Comments on "Bit-interleaved coded modulation"

Authors:
V. Sethuraman;B. Hajek
Affiliations:
Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 7

Bit-Interleaved Coded Modulation

Foundations and Trends in Communications and Information Theory
Distribution of L-values in gray-mapped M2-QAM: closed-form approximations and applications

IEEE Transactions on Communications
Performance analysis and design criteria of BICM-ID with signal space diversity for keyhole Nakagami-m fading channels

IEEE Transactions on Information Theory
Performance of BICM-SC and BICM-OFDM systems with diversity reception in non-Gaussian noise and interference

IEEE Transactions on Communications
Performance evaluation of QAM-based BICM: an analytical approach

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
An analytical approach for performance evaluation of BICM transmission over Nakagami-m fading channels

IEEE Transactions on Communications
Robust Lp-norm decoding for BICM-based secondary user systems

IEEE Transactions on Communications

Quantified Score

Hi-index	754.90

Visualization

Abstract

Caire, Taricco, and Biglieri presented a detailed analysis of bit-interleaved coded modulation (BICM), a simple and popular technique used to improve system performance, especially in the context of fading channels. They derived an upper bound to the probability of error, called the expurgated bound. In this correspondence, the proof of the expurgated bound is shown to be flawed. A new upper bound is also derived. It is not known whether the original expurgated bound is valid for the important special case of square QAM with Gray labeling, but the new bound is very close to, and slightly tighter than, the original bound for a numerical example.