Comments on "Bit-interleaved coded modulation"

DOI10.1109/TIT.2006.871052MaRDI QIDQ3547607zbMATH OpenOpenAlexFDO

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0506052

Modulation and demodulation in information and communication theory (94A14) Channel models (including quantum) in information and communication theory (94A40) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Abstract: Caire, Taricco and Biglieri presented a detailed analysis of bit interleaved coded modulation, 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.

Cited in

(1)

Corrections to “Bit-Interleaved Coded Modulation in the Wideband Regime” [Dec 08 5447-5455

This page was built for publication: Comments on "Bit-interleaved coded modulation"

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547607)