English
Related papers

Related papers: Bit-Interleaved Coded Modulation Revisited: A Mism…

200 papers

Bit-interleaved coded modulation (BICM) using (bi-)orthogonal signals is especially well suited for the application in impulse-radio ultra-wideband transmission systems, which typically operate in the power-limited regime and require a very…

Information Theory · Computer Science 2015-03-18 Andreas Schenk , Robert F. H. Fischer

This paper considers the problem of covert communication with mismatched decoding, in which a sender wishes to reliably communicate with a receiver whose decoder is fixed and possibly sub-optimal, and simultaneously to ensure that the…

Information Theory · Computer Science 2021-11-11 Qiaosheng Zhang , Vincent Y. F. Tan

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

This paper addresses the performance of bit-interleaved coded multiple beamforming (BICMB) [1], [2] with imperfect knowledge of beamforming vectors. Most studies for limited-rate channel state information at the transmitter (CSIT) assume…

Information Theory · Computer Science 2008-05-08 Ersin Sengul , Hong Ju Park , Ender Ayanoglu

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

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…

Information Theory · Computer Science 2016-11-15 Nicolas Gresset , Loic Brunel , Joseph Boutros

This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is…

Information Theory · Computer Science 2017-12-08 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical coded modulation…

Information Theory · Computer Science 2016-11-17 Pablo Piantanida , Sajad Sadough , Pierre Duhamel

A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar…

Information Theory · Computer Science 2013-02-04 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

In many practical communication systems, one binary encoder/decoder pair is used to communicate over a set of parallel channels. Examples of this setup include multi-carrier transmission, rate-compatible puncturing of turbo-like codes, and…

Information Theory · Computer Science 2024-01-25 Christian Häger , Alexandre Graell i Amat , Alex Alvarado , Fredrik Brännström , Erik Agrell

This paper investigates the design and performance of delayed bit-interleaved coded modulation (DBICM) with low-density parity-check (LDPC) codes. For Gray labeled square $M$-ary quadrature amplitude modulation (QAM) constellations, we…

Information Theory · Computer Science 2021-03-04 Yihuan Liao , Min Qiu , Jinhong Yuan

Optimal binary labelings, input distributions, and input alphabets are analyzed for the so-called bit-interleaved coded modulation (BICM) capacity, paying special attention to the low signal-to-noise ratio (SNR) regime. For 8-ary pulse…

Information Theory · Computer Science 2011-10-21 Erik Agrell , Alex Alvarado

Optimal binary labelings, input distributions, and input alphabets are analyzed for the so-called bit-interleaved coded modulation (BICM) capacity, paying special attention to the low signal-to-noise ratio (SNR) regime. For 8-ary pulse…

Information Theory · Computer Science 2011-10-21 Erik Agrell , Alex Alvarado

The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on…

Information Theory · Computer Science 2016-07-12 Shrinivas Kudekar , Santhosh Kumar , Marco Mondelli , Henry D. Pfister , Rüdiger Urbanke

We consider the problem of reliable communication over a discrete memoryless channel (DMC) with the help of a relay, termed the information bottleneck (IB) channel. There is no direct link between the source and the destination, and the…

Information Theory · Computer Science 2023-05-02 Michael Dikshtein , Nir Weinberger , Shlomo Shamai

We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission…

Information Theory · Computer Science 2021-03-29 Anelia Somekh-Baruch

Bit-interleaved coded modulation (BICM) and multilevel coded modulation (MLC) are commonly used to combine polar codes with high order modulation. While BICM benefits from simple design and the separation of coding and modulation, MLC shows…

Information Theory · Computer Science 2022-02-16 Hanwen Yao , Jinfeng Du , Alexander Vardy

Shannon's channel coding theorem characterizes the maximal rate of information that can be reliably transmitted over a communication channel when optimal encoding and decoding strategies are used. In many scenarios, however, practical…

Information Theory · Computer Science 2023-07-06 Jonathan Scarlett , Albert Guillén i Fàbregas , Anelia Somekh-Baruch , Alfonso Martinez

We propose a method for MIMO decoding when channel state information (CSI) is unknown to both the transmitter and receiver. The proposed method requires some structure in the transmitted signal for the decoding to be effective, in…

Signal Processing · Electrical Eng. & Systems 2018-02-06 Thomas R. Dean , Mary Wootters , Andrea J. Goldsmith