References & Further Reading

References

G. Caire, G. Taricco, and E. Biglieri, Bit-interleaved coded modulation, 1998
The foundational BICM paper. Sections II–IV establish the capacity results (Ch. 5 material); Sections V–VII establish the error-probability and diversity results that are the subject of the present chapter. Theorem 3 gives the BICM diversity formula $d_{\rm BICM} = d_H \cdot L_{\min}(\mu)$, which is the central design criterion derived here. CommIT contribution.
E. Zehavi, 8-PSK trellis codes for a Rayleigh channel, 1992
The BICM precursor. Zehavi first noticed that on a Rayleigh fading channel the time-diversity available to a binary code can be harvested by inserting a bit-interleaver between the encoder and the modulation mapper, even when the mapper uses Gray rather than set-partition labelling. This observation is the seed from which Caire–Taricco–Biglieri grew the full information-theoretic theory.
E. Biglieri, G. Caire, and G. Taricco, Coding for the fading channel: a survey, 2000
Survey that places BICM in context alongside TCM, MLC, and space-time coding. Clean re-derivation of the BICM PEP bound and the diversity-order formula, with Rayleigh-fading numerical comparisons that align with our simulations in this chapter.
A. Guillén i Fàbregas, A. Martinez, and G. Caire, Bit-interleaved coded modulation, 2008
Monograph-length treatment of BICM. Chapters 5–6 give a refined PEP analysis that sharpens the Chernoff/Bhattacharyya bounds used here. Recommended for readers who want tighter constants than the union bound delivers at low SNR.
J. G. Proakis and M. Salehi, Digital Communications, McGraw-Hill, 5th ed., 2008
Standard textbook reference. Chapter 14 derives the Rayleigh fading PEP bound that we specialise to BICM codewords in s03, and Chapter 7 covers the union-bound BER arithmetic that drives s04.
D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, 2005
Chapter 3 is the modern reference for diversity order and the high-SNR $\text{SNR}^{-d}$ slope. Our diversity-order definition in s03 matches this book.
E. Biglieri, Coding for Wireless Channels, Springer, 2005
Chapters 6–8 give a complete treatment of coded modulation on fading channels, including BICM PEP analysis and interleaver design. Complements our coverage with additional numerical examples and parallel treatments of TCM on fading.
A. J. Viterbi, Convolutional codes and their performance in communication systems, 1971
Classic performance analysis of convolutional codes, including the weight-enumerator-based union bound that we adapt in s04. Introduces the transfer-function machinery used to compute multiplicities $c_d$ for BICM union bounds with convolutional outer codes.
D. J. C. MacKay, Information Theory, Inference, and Learning Algorithms, Cambridge University Press, 2003
Chapters 1 and 13 treat union-bound analysis for binary linear codes with the clarity we aim for in s04. The "Shannon limit is not a bound on codes" discussion is the right mindset for understanding the looseness of the union bound at waterfall.
J. W. Craig, A new, simple and exact result for calculating the probability of error for two-dimensional signal constellations, 1991
The Craig integral representation of the Q-function that enables closed-form Rayleigh-fading PEP computation via $Q(x) = \frac{1}{\pi} \int_0^{\pi/2} \exp(-x^2/(2\sin^2\theta))\,d\theta$. Every fading-channel PEP analysis since 1991 uses this identity.
M. K. Simon and M.-S. Alouini, Unified approach to the performance analysis of digital communications over generalized fading channels, 1998
The moment-generating-function approach to PEP in fading. Makes the computation of diversity order transparent and extends cleanly to Nakagami-$m$, Ricean, and correlated fading — all relevant for BICM on realistic propagation.
3GPP, Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding, 2018. [Link]
LTE channel-coding and rate-matching specification. The sub-block/interleaver design in §5.1.4 is the canonical engineering realisation of the interleaver-depth theorem in s05.
3GPP, NR; Multiplexing and channel coding, 2022. [Link]
5G NR channel-coding specification. The LDPC rate matcher plus QAM mapper is BICM; the HARQ retransmission buffer and the bit-level interleaver together realise the "interleaver length $N \gg T_c$" condition discussed in s05.
ETSI, Digital Video Broadcasting (DVB); Second generation framing structure, channel coding and modulation systems (DVB-S2), 2014. [Link]
Satellite BICM with LDPC and APSK. The 64 800-bit FEC frame and its bit-interleaver were explicitly sized to exceed the atmospheric-scintillation coherence time — an engineering application of the bound in s05.
J. Hou, P. H. Siegel, L. B. Milstein, and H. D. Pfister, Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes, 2003
Shows that LDPC codes matched to the BICM bit-channel statistics approach the BICM capacity bound at high $d_H$, recovering in simulation what this chapter predicts by the union bound.
J. Hagenauer, E. Offer, and L. Papke, Iterative decoding of binary block and convolutional codes, 1996
The iterative-decoding framework that becomes BICM-ID in Ch. 8. Cited in the forward-reference wireless-connection block — the Gray-labelling optimum changes once iterative feedback is available, and set partitioning re-enters as a viable choice.