References & Further Reading

References

A. Guillén i Fàbregas, A. Martinez, and G. Caire, Bit-interleaved coded modulation, 2008
THE central CommIT contribution of this chapter. The 153-page Foundations and Trends monograph of Guillén i Fàbregas, Martínez, and Caire is the definitive information-theoretic treatment of BICM. It recasts the 1998 Caire-Taricco-Biglieri BICM capacity formula as the generalised mutual information (GMI) at decoder scaling $s = 1$, derives the BICM random-coding exponent via the product-metric Gallager function, proves the exponent ordering $E_r^{\rm BICM} \le E_r^{\rm CM}$, extends cleanly to fading and MIMO, and provides the theoretical foundation for Chs. 7–9 of this book. Chapters 3–4 of the monograph are mandatory reading for this chapter; Chs. 5–6 for Ch. 8 (BICM-ID) and Ch. 9 (standards) respectively.
A. Martinez, A. Guillén i Fàbregas, and G. Caire, Error probability analysis of bit-interleaved coded modulation, 2006
Companion analysis paper to the 2008 monograph. Derives the Martinez-Fàbregas-Caire saddle-point PEP bound (Thm. <a href="#thm-mfc-saddle-point-pep" class="ferkans-ref" title="Theorem: Martinez-Fàbregas-Caire Saddle-Point PEP Bound" data-ref-type="theorem"><span class="ferkans-ref-badge">T</span>Martinez-Fàbregas-Caire Saddle-Point PEP Bound</a>) that tightens the Caire-Taricco- Biglieri 1998 union bound by $\sim 1$–$2$ dB at moderate SNR. The first concrete demonstration that the mismatched-decoding GMI framework delivers numerical improvements beyond the information- theoretic cleanup.
G. Caire, G. Taricco, and E. Biglieri, Bit-interleaved coded modulation, 1998
The Chapter 5 anchor paper. Introduces the parallel-bit-channel model of BICM and the capacity formula $\ntn{cap}_{\rm BICM} = \sum_\ell \ntn{mi}(Y; B_\ell)$, proves Gray labelling is near-optimal on AWGN, and gives the union-bound PEP analysis on fading channels. This chapter's mismatched-decoding reframe provides the rigorous information-theoretic foundation of the 1998 formula.
U. Wachsmann, R. F. H. Fischer, and J. B. Huber, Multilevel codes: theoretical concepts and practical design rules, 1999
The canonical exposition of the parallel-channel framework for multilevel coding (MLC) and — by specialisation — for BICM as "MLC with maximal marginalisation". Provides the parallel-channel viewpoint of §1 that underlies the error-exponent analyses of §4–5.
R. G. Gallager, Information Theory and Reliable Communication, Wiley, 1968
The canonical reference for the random-coding error exponent $E_r(R) = \max_\rho [E_0(\rho) - \rho R]$ and the cutoff rate $R_0 = E_0(1)$. Chapter 5 of Gallager 1968 is the classical random-coding derivation; the BICM product-metric specialisation of §4 follows Gallager's template line by line with the mismatched metric in place of the true likelihood.
N. Merhav, G. Kaplan, A. Lapidoth, and S. Shamai (Shitz), On information rates for mismatched decoders, 1994
The foundational paper on mismatched decoding and the generalised mutual information (GMI). Establishes the random-coding achievability result with a mismatched metric: $\sup_s I^{\mathrm{GMI}}(s)$ is the largest rate achievable by a random code. The BICM-specific application in §2–3 of this chapter is a direct lift.
A. Ganti, A. Lapidoth, and İ. E. Telatar, Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit, 2000
Extension of Merhav-Kaplan-Lapidoth-Shamai 1994 to general channel models, including continuous alphabets and channels with memory. The bound $\sup_s I^{\mathrm{GMI}}(s) \le \ntn{cap}_{\rm CM}$ of Exercise <a href="#ex-ch07-13" class="ferkans-ref" title="Exercise: ex-ch07-13" data-ref-type="exercise"><span class="ferkans-ref-badge">E</span>ex-ch07-13</a> is due to this paper.
E. Zehavi, 8-PSK trellis codes for a Rayleigh channel, 1992
The BICM precursor. Observed that bit-interleaving a binary code before a non-binary mapper breaks up consecutive symbol errors on fading channels — the practical motivation before the 1998 information-theoretic analysis. Mentioned for completeness.
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge University Press, 2nd ed., 2011
Classical information-theory textbook. §10.3 develops the mismatched- decoding capacity framework, including the GMI and its relation to the true mismatched capacity (which may exceed the GMI for constant-composition codes). Background reference for the pitfall note of §2.
E. Biglieri, Coding for Wireless Channels, Springer, 2005
Comprehensive textbook on coded modulation for wireless by one of the CTB-1998 authors. Chapter on BICM complements this chapter's treatment with additional design examples and an accessible exposition of Gallager-exponent analysis.
J. G. Proakis and M. Salehi, Digital Communications, McGraw-Hill, 5th ed., 2008
Standard textbook. Chapter 8 covers trellis-coded and BICM modulation with Bhattacharyya-factor PEP analysis. Constellation energy normalisations and BI-AWGN capacity evaluations in the examples follow this reference.
T. J. Richardson and R. L. Urbanke, Modern Coding Theory, Cambridge University Press, 2008
Standard reference on capacity-approaching binary codes. §4 covers density evolution for LDPC decoders on memoryless channels — relevant for the engineering note of §5 on why LDPC+BP operates above the cutoff rate despite Gallager's theorem.
3GPP, NR; Multiplexing and channel coding, 2022. [Link]
5G NR channel-coding specification. A single LDPC base graph (BG1/BG2) feeds every QPSK / 16 / 64 / 256 / 1024-QAM constellation. The LLR-scaling tap and max-log demapper choices are implementation-specific and not standardised. Cited in engineering notes of §2 and §5.
G. D. Forney Jr. and G. Ungerboeck, Modulation and coding for linear Gaussian channels, 1998
Definitive survey of coded modulation for the Gaussian channel. §IV discusses BICM, MLC, and the mismatched-decoding viewpoint. Complementary reading to the CTB-1998 paper and this chapter.