Comments on "bit-interleaved coded modulation"

Vignesh Sethuraman, Bruce Hajek

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)1795-1797
Number of pages3
JournalIEEE Transactions on Information Theory
Volume52
Issue number4
DOIs
StatePublished - Apr 1 2006

Keywords

  • Bit-interleaved coded modulation (BICM)
  • Expurgated bound
  • Probability of error

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Comments on "bit-interleaved coded modulation"'. Together they form a unique fingerprint.

  • Cite this