Three-Dimensional EXIT Chart Analysis of Iterative Detection Aided Coded Modulation Schemes

The iterative convergence of iteratively detected coded modulation schemes having different block lengths, decoding complexity and an unequal error protection capability is studied, when communicating over AWGNchannels using 8PSK modulation. More specifically, the coded modulation schemes investigated include Multilevel Coding (MLC), Trellis Coded Modulation (TCM), Turbo Trellis Coded Modulation (TTCM), Bit-Interleaved Coded Modulation (BICM) as well as Bit-Interleaved Coded Modulation employing Iterative Decoding (BICM-ID). A novel three dimensional EXIT chart was introduced for studying the iterative convergence behaviour of the Multistage Decoding (MSD) scheme used in MLC

Bit-interleaved coded modulation

The principle of coding in the signal space follows directly from Shannon’s analysis of waveform Gaussian channels subject to an input constraint. The early design of communication systems focused separately on modulation, and error correcting codes. Bit-interleaved coded modulation (BICM) is a pragmatic approach combining the best out of both worlds: it takes advantage of the signal-space coding perspective, whilst allowing for the use of powerful families of binary codes with virtually any modulation format. As matter of fact, has established itself as a quasi-standard (de-facto) for bandwidth - and power - efficient communication, like DSL, wireless LANs, WiMax. The aim of this thesis is to describe the main aspects of the system, focusing the attention on model characteristics and on the error analysis (based on bit-error rate approximations). Finally I also consider the BICM with iterative decoding and I conclude with an overview of some applications of BIC

Bit-interleaved coded modulation in the wideband regime

The wideband regime of bit-interleaved coded modulation (BICM) in Gaussian channels is studied. The Taylor expansion of the coded modulation capacity for generic signal constellations at low signal-to-noise ratio (SNR) is derived and used to determine the corresponding expansion for the BICM capacity. Simple formulas for the minimum energy per bit and the wideband slope are given. BICM is found to be suboptimal in the sense that its minimum energy per bit can be larger than the corresponding value for coded modulation schemes. The minimum energy per bit using standard Gray mapping on M-PAM or M^2-QAM is given by a simple formula and shown to approach -0.34 dB as M increases. Using the low SNR expansion, a general trade-off between power and bandwidth in the wideband regime is used to show how a power loss can be traded off against a bandwidth gain.Comment: Submitted to IEEE Transactions on Information Theor

Bit-Interleaved Coded Modulation Revisited: A Mismatched Decoding Perspective

We revisit the information-theoretic analysis of bit-interleaved coded modulation (BICM) by modeling the BICM decoder as a mismatched decoder. The mismatched decoding model is well-defined for finite, yet arbitrary, block lengths, and naturally captures the channel memory among the bits belonging to the same symbol. We give two independent proofs of the achievability of the BICM capacity calculated by Caire et al. where BICM was modeled as a set of independent parallel binary-input channels whose output is the bitwise log-likelihood ratio. Our first achievability proof uses typical sequences, and shows that due to the random coding construction, the interleaver is not required. The second proof is based on the random coding error exponents with mismatched decoding, where the largest achievable rate is the generalized mutual information. We show that the generalized mutual information of the mismatched decoder coincides with the infinite-interleaver BICM capacity. We also show that the error exponent -and hence the cutoff rate- of the BICM mismatched decoder is upper bounded by that of coded modulation and may thus be lower than in the infinite-interleaved model. We also consider the mutual information appearing in the analysis of iterative decoding of BICM with EXIT charts. We show that the corresponding symbol metric has knowledge of the transmitted symbol and the EXIT mutual information admits a representation as a pseudo-generalized mutual information, which is in general not achievable. A different symbol decoding metric, for which the extrinsic side information refers to the hypothesized symbol, induces a generalized mutual information lower than the coded modulation capacity.Comment: submitted to the IEEE Transactions on Information Theory. Conference version in 2008 IEEE International Symposium on Information Theory, Toronto, Canada, July 200

Bit-Interleaved Coded Modulation (BICM) for ATSC 3.0

"(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.")In this paper, we summarize and expound upon the choices made for the bit-interleaved coded modulation (BICM) part of the next-generation terrestrial broadcast standard known as ATSC 3.0. The structure of the ATSC 3.0 BICM consists of a forward error correcting code, bit interleaver, and constellation mapper. In order to achieve high efficiency over a wide range of reception conditions and carrier-to-noise (C/N) ratio values, several notable new elements have been standardized. First, 24 original low-density parity check (LDPC) codes have been designed, with coding rates from 2/15 (0.13) up to 13/15 (0.87) for two code sizes: 16 200 bits and 64 800 bits. Two different LDPC structures have been adopted; one structure more suited to medium and high coding rates and another structure suited to very low coding rates. Second, in addition to quaternary phase shift keying, non-uniform constellations (NUCs) have been chosen for constellation sizes from 16QAM to 4096QAM to bridge the gap to the Shannon theoretical limit. Two different types of NUCs have been proposed: 1-D NUCs for 1024- and 4096-point constellations, and 2-D-NUCs for 16-, 64-, and 256-point constellations. 2-D-NUCs achieve a better performance than 1-D-NUCs but with a higher complexity since they cannot be separated into two independent I/Q components. NUCs have been optimized for each coding rate for the 64 800 bits LPDCs. The same constellations are used for 16 200 bits LDPCs, although they have been limited up to 256QAM. Finally, a bit interleaver, optimized for each NUC/coding rate combination, has been designed to maximize the performance. The result is a BICM that provides the largest operating range (more than 30 dB, with the most robust mode operating below -5 dB C/N) and the highest spectral efficiency compared to any digital terrestrial broadcast system today, outperforming the current state-of-the-art DVB-T2 standard BICM by as much as 1 dB in some cases. ATSC 3.0 will also provide a considerable increase in the maximum transmission capacity when using the high-order NUCs such as 1024QAM and 4096QAM, which will represent a major milestone for terrestrial broadcasting since the highest order constellation currently available is uniform 256QAM. This paper describes the coding, modulation, and bit interleaving modules of the BICM block of ATSC 3.0 and compares its performance with other DTT standards such as ATSC A/53 and DVB-T2.Michael, L.; Gómez Barquero, D. (2016). Bit-Interleaved Coded Modulation (BICM) for ATSC 3.0. IEEE Transactions on Broadcasting. 62(1):181-188. doi:10.1109/TBC.2015.2505414S18118862