Prerequisites & Notation
Before You Begin
Chapter 17 sits at the crossroads of three earlier strands of the book. From Part III we import the diversity-multiplexing tradeoff (Ch. 12) and the CDA-NVD construction (Ch. 13): they frame the question we are trying to answer and give us the algebraic benchmark. From Part IV we import lattice fundamentals (Ch. 15) and the Erez-Zamir mod- scheme (Ch. 16): they give us the coding tools. The theorem of El Gamal, Caire, and Damen (2004) β the heart of this chapter β is what happens when you combine all three: a lattice code (Ch. 16) is transported onto a MIMO fading channel (Ch. 12), decoded with a receiver (MMSE-GDFE) that mirrors MMSE-SIC for Gaussian random codes, and achieves the full Zheng-Tse DMT curve β the same goal CDA-NVD (Ch. 13) achieves through algebra. Both proofs are covered; the reader should understand why they are complementary, not redundant.
- Diversity-multiplexing tradeoff and the Zheng-Tse curve(Review ch12)
Self-check: Can you state for , piecewise-linearly interpolated, and sketch the tradeoff for a i.i.d. Rayleigh channel? Do you recognise the converse argument via the outage-probability exponent?
- CDA-NVD codes and the algebraic DMT-optimality proof(Review ch13)
Self-check: Can you explain why a cyclic division algebra with non-vanishing determinant achieves for every , and why the NVD property absorbs the -dependence of the union bound into the asymptotic equivalence?
- Lattice fundamentals: generator matrix, dual lattice, packing density(Review ch15)
Self-check: Can you write down a generator matrix for and for the Leech lattice , state their kissing numbers ( and ), and relate packing density to the coding gain over ?
- Erez-Zamir lattice AWGN coding and the mod- scheme(Review ch16)
Self-check: Can you state the Erez-Zamir result β lattice coding with MMSE scaling and common random dithering achieves on AWGN β and sketch why the MMSE factor is necessary (the lattice sees an effective noise variance )?
- QR decomposition of rectangular matrices (Gram-Schmidt)
Self-check: Given with , can you compute with having orthonormal columns and upper- triangular? This is the decomposition used in MMSE-GDFE.
- Basic MIMO model and ZF / MMSE / SIC receivers(Review ch10)
Self-check: Can you write down the zero-forcing receiver , the MMSE receiver , and explain how MMSE-SIC (successive interference cancellation) achieves the MIMO sum capacity?
Notation for This Chapter
Notation combines the MIMO symbols from Ch. 10-13 (channel matrix , SNR , noise ), the lattice symbols from Ch. 15-16 (fine lattice , shaping lattice , dither ), and LAST-specific symbols introduced here (MMSE coefficient , MMSE-GDFE filter , triangular matrix ).
| Symbol | Meaning | Introduced |
|---|---|---|
| Number of transmit and receive antennas | s01 | |
| Block length (channel uses per codeword matrix) | s01 | |
| Space-time codeword matrix | s01 | |
| MIMO channel matrix (i.i.d. entries under Rayleigh) | s01 | |
| Codeword-difference matrix | s01 | |
| Fine (coding) lattice of the LAST code | s01 | |
| Coarse (shaping) lattice; codewords lie in | s01 | |
| Generator matrix of (real-valued after complex-to-real isomorphism) | s01 | |
| Common random dither, uniform on | s01 | |
| Average signal-to-noise ratio at each receive antenna | s01 | |
| Receiver noise vector, per channel use | s02 | |
| MMSE coefficient; (real-valued form) or (Erez-Zamir form) | s02 | |
| MMSE-GDFE feed-forward filter | s02 | |
| Upper-triangular matrix from QR decomposition of the augmented channel | s02 | |
| Zheng-Tse DMT curve | s03 | |
| Coding gain of lattice over | s04 | |
| Gosset lattice in (densest packing in 8D; kissing number 240) | s04 | |
| Leech lattice in (densest packing in 24D; kissing number 196560) | s04 |