English
Related papers

Related papers: On the Asymptotic Performance of Bit-Wise Decoders…

200 papers

In this paper we propose a new design criterion and a new class of unitary signal constellations for differential space-time modulation for multiple-antenna systems over Rayleigh flat-fading channels with unknown fading coefficients.…

Information Theory · Computer Science 2008-05-12 Xinjia Chen , Kemin Zhou , Jorge Aravena

Error and erasure exponents for the broadcast channel with degraded message sets are analyzed. The focus of our error probability analysis is on the main receiver where, nominally, both messages are to be decoded. A two-step decoding…

Information Theory · Computer Science 2015-01-28 Vincent Y. F. Tan

This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state…

Signal Processing · Electrical Eng. & Systems 2017-12-21 Mohammadreza Darabi

This paper investigates the problem of zero-delay joint source-channel coding of a vector Gauss-Markov source over a multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channel with feedback. In contrast to the…

Information Theory · Computer Science 2023-10-19 Barron Han , Oron Sabag , Victoria Kostina , Babak Hassibi

Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach capacity, as…

Information Theory · Computer Science 2012-12-03 Aravind R. Iyengar , Paul H. Siegel , Rudiger L. Urbanke , Jack K. Wolf

We study the performance of binary spatially-coupled low-density parity-check codes (SC-LDPC) when used with bit-interleaved coded-modulation (BICM) schemes. This paper considers the cases when transmission takes place over additive white…

Information Theory · Computer Science 2013-03-05 Arvind Yedla , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

The maximum-likelihood (ML) decoder for symbol detection in large multiple-input multiple-output wireless communication systems is typically computationally prohibitive. In this paper, we study a popular and practical alternative, namely…

Signal Processing · Electrical Eng. & Systems 2018-07-04 Christos Thrampoulidis , Weiyu Xu , Babak Hassibi

Reliable communication over delay-constrained block-fading channels with discrete inputs and mismatched (imperfect) channel state information at the transmitter (CSIT) is studied. The CSIT mismatch is modeled as Gaussian random variables,…

Information Theory · Computer Science 2009-06-02 Tung T. Kim , Albert Guillen i Fabregas

We introduce a novel approach to error correction decoding in the presence of additive alpha-stable noise, which serves as a model of interference-limited wireless systems. In the absence of modifications to decoding algorithms, treating…

Information Theory · Computer Science 2024-10-31 Charles Wiame , Ken R. Duffy , Muriel Médard

Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be significantly improved when the interleaver takes a trivial form (BICM-T), i.e., when it does…

Information Theory · Computer Science 2013-03-26 Alex Alvarado , Leszek Szczecinski , Erik Agrell

We show that a simple modification of the surface code can exhibit an enormous gain in the error correction threshold for a noise model in which Pauli Z errors occur more frequently than X or Y errors. Such biased noise, where dephasing…

Quantum Physics · Physics 2018-02-07 David K. Tuckett , Stephen D. Bartlett , Steven T. Flammia

This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and…

Information Theory · Computer Science 2025-05-28 Priyanka Patel , Francesc Molina , Albert Guillén i Fàbregas

The exact order of the optimal sub-exponentially decaying factor in the classical bounds on the error probability of fixed-length codes over a Gallager-symmetric discrete memoryless channel with and without ideal feedback is determined.…

Information Theory · Computer Science 2019-09-02 Yücel Altuğ , Aaron B. Wagner

Low-density parity-check (LDPC) codes have been used for communication over a two-user Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at…

Information Theory · Computer Science 2016-11-18 Mahdi Ramezani , Masoud Ardakani

In this paper, we introduce a deep learning-based decoder designed for concatenated coding schemes over a deletion/substitution channel. Specifically, we focus on serially concatenated codes, where the outer code is either a convolutional…

Information Theory · Computer Science 2024-10-15 E. Uras Kargı , Tolga M. Duman

It has been shown lately the optimality of uncoded transmission in estimating Gaussian sources over homogeneous/symmetric Gaussian multiple access channels (MAC) using multiple sensors. It remains, however, unclear whether it still holds…

Information Theory · Computer Science 2007-09-27 Shuangqing Wei , Rajgopal Kannan , Sitharama Iyengar , Nageswara S. Rao

Understanding the probability of error is paramount in the design and analysis of digital communication systems, particularly in Rayleigh fading channels where signal impairments are prevalent. This article presents a unified approach for…

Signal Processing · Electrical Eng. & Systems 2024-11-05 Amr Abdelbari , Bülent Bilgehan

We consider the special case of index coding over the Gaussian broadcast channel where each receiver has prior knowledge of a subset of messages at the transmitter and demands all the messages from the source. We propose a concatenated…

Information Theory · Computer Science 2015-07-02 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…

Information Theory · Computer Science 2014-03-05 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

We study matched and Euclidean-mismatched decoding on finite Fourier-curve constellations with tangent-space artificial noise. Each hypothesis induces a Gaussian law with symbol-dependent rank-one covariance. We derive exact Euclidean…

Information Theory · Computer Science 2026-04-24 Bin Han , Hao Chen , Muxia Sun , H. V. Poor , Hans D. Schotten