English
Related papers

Related papers: Achievable Rates for Shaped Bit-Metric Decoding

200 papers

An energy-efficient approach is presented for shaping a bit-interleaved low-density parity-check (LDPC) coded amplitude phase-shift keying (APSK) system. A subset of the interleaved bits output by a binary LDPC encoder are passed through a…

Information Theory · Computer Science 2013-04-22 Matthew C. Valenti , Xingyu Xiang

This paper is concerned with bounds on the maximum-likelihood (ML) decoding error probability of Reed-Solomon (RS) codes over additive white Gaussian noise (AWGN) channels. To resolve the difficulty caused by the dependence of the Euclidean…

Information Theory · Computer Science 2014-01-22 Qiutao Zhuang , Xiao Ma , Aleksander Kavcic

The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a…

Information Theory · Computer Science 2024-10-28 Anatoly Khina , Neri Merhav

We consider the problem of jointly optimum modulation and estimation of a real-valued random parameter, conveyed over an additive white Gaussian noise (AWGN) channel, where the performance metric is the large deviations behavior of the…

Information Theory · Computer Science 2016-11-17 Neri Merhav

Modulo-wrapping receivers have attracted interest in several areas of digital communications, including precoding and lattice coding. The asymptotic capacity and error performance of the modulo AWGN channel have been well established.…

Information Theory · Computer Science 2021-05-21 Gizem Tabak , Andrew Singer

A class of circular 64-QAM that combines 'geometric' and 'probabilistic' shaping aspects is presented. It is compared to square 64-QAM in back-to-back, single-channel, and WDM transmission experiments. First, for the linear AWGN channel…

We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…

Information Theory · Computer Science 2017-09-25 Sandra Bender , Meik Dörpinghaus , Gerhard Fettweis

The mutual information of bit-interleaved coded modulation (BICM) systems, sometimes called the BICM capacity, is investigated at low signal-to-noise ratio (SNR), i.e., in the wideband regime. A new linear transform that depends on bits'…

Information Theory · Computer Science 2014-04-23 Erik Agrell , Alex Alvarado

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

We introduce a trainable coded modulation scheme that enables joint optimization of the bit-wise mutual information (BMI) through probabilistic shaping, geometric shaping, bit labeling, and demapping for a specific channel model and for a…

Information Theory · Computer Science 2020-04-15 Fayçal Ait Aoudia , Jakob Hoydis

A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the Cover-Leung rate region [1], and it is shown that the…

Information Theory · Computer Science 2014-03-31 Ramji Venkataramanan , S. Sandeep Pradhan

Achievable information rates are used as a metric to design novel modulation formats via geometric shaping. The proposed geometrically shaped 256-ary constellation achieves SNR gains of up to 1.18 dB.

Information Theory · Computer Science 2020-06-05 Bin Chen , Chigo Okonkwo , Hartmut Hafermann , Alex Alvarado

The construction of optimal non-uniform mappings for discrete input memoryless channels (DIMCs) is investigated. An efficient algorithm to find optimal mappings is proposed and the rate by which a target distribution is approached is…

Information Theory · Computer Science 2014-07-09 Georg Böcherer

The binary asymmetric channel is a model for practical communication systems where the error probabilities for symbol transitions $0\rightarrow 1$ and $1\rightarrow0$ differ substantially. In this paper, we introduce the notion of…

Information Theory · Computer Science 2026-04-10 Shukai Wang , Cuiling Fan , Chunming Tang , Zhengchun Zhou

Within the Guessing Random Additive Noise Decoding (GRAND) family, ordered reliability bits GRAND (ORBGRAND) has received considerable attention for its hardware-friendly exploitation of soft information. Existing information-theoretic…

Information Theory · Computer Science 2026-03-12 Zhuang Li , Wenyi Zhang

In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total…

Information Theory · Computer Science 2012-07-26 Kenneth Andrews , Sam Dolinar

This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different…

Information Theory · Computer Science 2011-10-26 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

Bit-interleaved coded modulation (BICM) is a practical approach for reliable communication over the AWGN channel in the bandwidth limited regime. For a signal point constellation with 2^m points, BICM labels the signal points with bit…

Information Theory · Computer Science 2012-06-04 Georg Böcherer , Fabian Altenbach , Alex Alvarado , Steven Corroy , Rudolf Mathar

This paper investigates guesswork over ordered statistics and formulates the achievable guesswork complexity of ordered statistics decoding (OSD) in binary additive white Gaussian noise (AWGN) channels. The achievable guesswork complexity…

Information Theory · Computer Science 2024-12-18 Chentao Yue , Changyang She , Branka Vucetic , Yonghui Li

Bit-interleaved coded modulation (BICM) transceivers often use equally spaced constellations and a random interleaver. In this paper, we propose a new BICM design, which considers hierarchical (nonequally spaced) constellations, a bit-level…

Information Theory · Computer Science 2013-03-26 Md. Jahangir Hossain , Alex Alvarado , Leszek Szczecinski