Chapter Summary
Chapter Summary
Key Points
- 1.
Multilevel coding is the Imai–Hirasawa construction. Given a partition chain of length on a constellation, MLC uses one binary code per level, combined through a partition-based labelling . The construction is modular: the binary codes can be convolutional, LDPC, polar, or any future binary code.
- 2.
The capacity rule is the chain rule in disguise. The CM capacity decomposes exactly as via the chain rule of mutual information. Setting at every level is the unique rate allocation that achieves the full with MLC. No other allocation works.
- 3.
Multistage decoding realises the rule. MSD decodes the levels sequentially, feeding the decoded bits from level as side information to level . Its complexity is linear in rather than exponential in the aggregate rate, yet it achieves the same capacity as a joint ML decoder.
- 4.
Error propagation in MSD is benign at the capacity operating point. A history error at stage costs up to a dB distance reduction at stage , but the propagation bound shows the penalty is negligible when each stage operates near its own threshold.
- 5.
CM BICM sum of independent levels, always. The CM capacity dominates the BICM capacity by . Under Gray labelling the gap is empirically tiny — well under bit over all practical SNRs, and essentially zero for square QAM at moderate rates.
- 6.
BICM won the wireless modem war. Despite MLC's theoretical optimality, every major wireless standard from DVB-S2 onwards chose Gray-BICM with a single adaptive-rate binary code. The reasons are operational: one code covers every modulation, rate adaptation is trivial, interleaver depth tames fading, and iterative demapping closes most of the residual gap.
- 7.
MLC still wins on APSK and lattices. Constellations without a good Gray labelling — notably satellite APSK — retain a substantive MLC advantage. The lattice coded modulation of Ch. 4 is essentially MLC over a sub-lattice partition chain.
Looking Ahead
With TCM (Ch. 2) and MLC/MSD (Ch. 3) we have the two classical coded-modulation architectures. Chapter 4 moves from finite constellations to lattice coded modulation — the same partition-chain framework generalised to infinite point sets with group structure, where MLC reappears naturally and where shaping gain (the dB Shannon reward) becomes accessible. Chapter 5 then introduces the BICM framework in full — closing the loop opened in s04 of this chapter by setting out the Caire–Taricco–Biglieri framework as the foundation of all modern wireless coded modulation.