English
Related papers

Related papers: Achievable Rates for Shaped Bit-Metric Decoding

200 papers

The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods:…

Information Theory · Computer Science 2013-05-03 Anelia Somekh-Baruch

In this paper, we investigate the achievable rate of a diffusive Molecular Communication (MC) channel with fully absorbing receiver, which counts particles absorbed along each symbol interval and resets the counter at every interval…

Information Theory · Computer Science 2023-06-08 Fardad Vakilipoor , Luca Barletta , Stefano Bregni , Maurizio Magarini

Horstein, Burnashev, Shayevitz and Feder, Naghshvar et al. and others have studied sequential transmission of a K-bit message over the binary symmetric channel (BSC) with full, noiseless feedback using posterior matching. Yang et al.…

Information Theory · Computer Science 2023-03-13 Amaael Antonini , Rita Gimelshein , Richard Wesel

We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. We first provide a proof of our recent conjecture on the…

Information Theory · Computer Science 2008-05-15 Jaspreet Singh , Onkar Dabeer , Upamanyu Madhow

Shaping modulation formats in multi-dimensional (MD) space is an effective approach to harvest spectral efficiency gains in both the additive white Gaussian noise (AWGN) channel and the optical fiber channel. In the first part of this…

Information Theory · Computer Science 2023-02-08 Bin Chen , Yi Lei , Gabriele Liga , Zhiwei Liang , Wei Ling , Xuwei Xue , Alex Alvarado

This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $\epsilon$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The…

Information Theory · Computer Science 2015-07-15 Wei Yang , Giuseppe Caire , Giuseppe Durisi , Yury Polyanskiy

Bit-interleaved coded modulation with iterative decoding (BICM-ID) offers very good error performance over additive white Gaussian noise (AWGN) and fading channels if it uses a wisely designed signal mapping. Further, error performance of…

Information Theory · Computer Science 2017-01-06 Hassan M. Navazi , Md. Jahangir Hossain

The interference channel with degraded message sets (IC-DMS) refers to a communication model in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one of the senders has…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Xin Yan

Despite considerable progress on the information-theoretic broadcast channel, the capacity region of fading broadcast channels with channel state known at the receivers but unknown at the transmitter remains unresolved. We address this…

Information Theory · Computer Science 2009-04-22 David Tse , Roy Yates

Autoencoder-based geometric shaping is proposed that includes optimizing bit mappings. Up to 0.2 bits/QAM symbol gain in GMI is achieved for a variety of data rates and in the presence of transceiver impairments. The gains can be harvested…

Information Theory · Computer Science 2019-07-22 Rasmus T. Jones , Metodi P. Yankov , Darko Zibar

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of $2^K-1$ information sources, ordered in a decreasing level of importance, is encoded into $K$ messages (or descriptions). There are $2^K-1$ decoders,…

Information Theory · Computer Science 2009-11-13 Soheil Mohajer , Chao Tian , Suhas N. Diggavi

In this paper, we propose a simple procedure to construct (decodable) good codes with any given alphabet (of moderate size) for any given (rational) code rate to achieve any given target error performance (of interest) over additive white…

Information Theory · Computer Science 2015-10-19 Chulong Liang , Xiao Ma , Baoming Bai

We consider probabilistic shaping to maximize the achievable information rate of coded modulation (CM) with hard decision decoding. The proposed scheme using binary staircase codes outperforms its uniform CM counterpart by more than 1.3 dB…

Information Theory · Computer Science 2017-05-08 Alireza Sheikh , Alexandre Graell i Amat , Gianluigi Liva

A probabilistic shaping method for multi-level coding (MLC) is presented, where the transmitted symbols are forced to have a shaped non-uniform distribution. It is shown that shaping only a single bit-level suffices to compensate for most…

Information Theory · Computer Science 2018-12-20 Onurcan İşcan , Ronald Böhnke , Wen Xu

An online shaping technique for high performance communication over Gaussian channels with Inter-Symbol Interference (ISI) and receiver Analog to Digital Converter (ADC) noise is presented. The technique uses online transmitter precoding…

Information Theory · Computer Science 2020-10-15 Or Levi , Dan Raphaeli

This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs…

Information Theory · Computer Science 2016-11-17 Ligong Wang , Gregory Wornell , Lizhong Zheng

We introduce a new family of concatenated codes with an outer low-density parity-check (LDPC) code and an inner low-density generator matrix (LDGM) code, and prove that these codes can achieve capacity under any memoryless binary-input…

Information Theory · Computer Science 2016-08-31 Chun-Hao Hsu , Achilleas Anastasopoulos

A concatenated coding scheme over binary memoryless symmetric (BMS) channels using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents and upper bounds on the error rate are derived. The first…

Information Theory · Computer Science 2017-10-24 Dina Goldin , David Burshtein

Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…

Information Theory · Computer Science 2024-03-22 Ioannis Papoutsidakis , Robert J. Piechocki , Angela Doufexi

We consider the problem of modulating the value of a parameter onto a band-limited signal to be transmitted over a continuous-time, additive white Gaussian noise (AWGN) channel, and estimating this parameter at the receiver. The performance…

Information Theory · Computer Science 2016-06-22 Nir Weinberger , Neri Merhav