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-Ξ›\Lambda 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 dβˆ—(r)=(ntβˆ’r)(nrβˆ’r)d^*(r) = (n_t - r)(n_r - r) for rin0,1,ldots,min(nt,nr)r \\in \\{0, 1, \\ldots, \\min(n_t, n_r)\\}, piecewise-linearly interpolated, and sketch the tradeoff for a 2times22 \\times 2 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 dβˆ—(r)d^*(r) for every rr, and why the NVD property absorbs the MM-dependence of the union bound into the asymptotic doteq\\doteq equivalence?

  • Lattice fundamentals: generator matrix, dual lattice, packing density(Review ch15)

    Self-check: Can you write down a generator matrix mathbfG\\mathbf{G} for E8E_8 and for the Leech lattice Lambda24\\Lambda_{24}, state their kissing numbers (240240 and 196560196560), and relate packing density to the coding gain gammac(Lambda)\\gamma_c(\\Lambda) over mathbbZn\\mathbb{Z}^n?

  • Erez-Zamir lattice AWGN coding and the mod-Ξ›\Lambda scheme(Review ch16)

    Self-check: Can you state the Erez-Zamir result β€” lattice coding with MMSE scaling alpha=textSNR/(textSNR+1)\\alpha = \\text{SNR}/(\\text{SNR}+1) and common random dithering achieves tfrac12log2(1+textSNR)\\tfrac12 \\log_2(1 + \\text{SNR}) on AWGN β€” and sketch why the MMSE factor is necessary (the lattice sees an effective noise variance 1/(textSNR+1)1/(\\text{SNR}+1))?

  • QR decomposition of rectangular matrices (Gram-Schmidt)

    Self-check: Given mathbfAinmathbbRmtimesn\\mathbf{A} \\in \\mathbb{R}^{m \\times n} with mgenm \\ge n, can you compute mathbfA=mathbfQmathbfR\\mathbf{A} = \\mathbf{Q} \\mathbf{R} with mathbfQinmathbbRmtimesn\\mathbf{Q} \\in \\mathbb{R}^{m \\times n} having orthonormal columns and mathbfRinmathbbRntimesn\\mathbf{R} \\in \\mathbb{R}^{n \\times n} upper- triangular? This is the decomposition used in MMSE-GDFE.

  • Basic MIMO model y=Hx+w\mathbf{y} = \mathbf{H}\mathbf{x} + \mathbf{w} and ZF / MMSE / SIC receivers(Review ch10)

    Self-check: Can you write down the zero-forcing receiver hatmathbfxtextZF=(mathbfHHmathbfH)βˆ’1mathbfHHmathbfy\\hat{\\mathbf{x}}_{\\text{ZF}} = (\\mathbf{H}^H \\mathbf{H})^{-1} \\mathbf{H}^H \\mathbf{y}, the MMSE receiver hatmathbfxtextMMSE=(mathbfHHmathbfH+alphamathbfI)βˆ’1mathbfHHmathbfy\\hat{\\mathbf{x}}_{\\text{MMSE}} = (\\mathbf{H}^H \\mathbf{H} + \\alpha \\mathbf{I})^{-1} \\mathbf{H}^H \\mathbf{y}, 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 mathbfH\\mathbf{H}, SNR textSNR\\text{SNR}, noise mathbfw\\mathbf{w}), the lattice symbols from Ch. 15-16 (fine lattice Lambdac\\Lambda_c, shaping lattice Lambdas\\Lambda_s, dither mathbfd\\mathbf{d}), and LAST-specific symbols introduced here (MMSE coefficient alpha\\alpha, MMSE-GDFE filter mathbfF\\mathbf{F}, triangular matrix mathbfR\\mathbf{R}).

SymbolMeaningIntroduced
nt,nrn_t, n_rNumber of transmit and receive antennass01
TTBlock length (channel uses per codeword matrix)s01
X∈CntΓ—T\mathbf{X} \in \mathbb{C}^{n_t \times T}Space-time codeword matrixs01
H∈CnrΓ—nt\mathbf{H} \in \mathbb{C}^{n_r \times n_t}MIMO channel matrix (i.i.d. CN(0,1)\mathcal{CN}(0,1) entries under Rayleigh)s01
Ξ”\boldsymbol{\Delta}Codeword-difference matrix Xβˆ’X^\mathbf{X} - \hat{\mathbf{X}}s01
Ξ›cβŠ‚RntT\Lambda_c \subset \mathbb{R}^{n_t T}Fine (coding) lattice of the LAST codes01
Ξ›sβŠ‚Ξ›c\Lambda_s \subset \Lambda_cCoarse (shaping) lattice; codewords lie in Ξ›c∩V(Ξ›s)\Lambda_c \cap \mathcal{V}(\Lambda_s)s01
G\mathbf{G}Generator matrix of Ξ›c\Lambda_c (real-valued after complex-to-real isomorphism)s01
d\mathbf{d}Common random dither, uniform on V(Ξ›s)\mathcal{V}(\Lambda_s)s01
SNR\text{SNR}Average signal-to-noise ratio at each receive antennas01
w∈Cnr\mathbf{w} \in \mathbb{C}^{n_r}Receiver noise vector, CN(0,I)\mathcal{CN}(0, \mathbf{I}) per channel uses02
Ξ±\alphaMMSE coefficient; Ξ±=1/SNR\alpha = 1/\text{SNR} (real-valued form) or Ξ±=SNR/(SNR+1)\alpha = \text{SNR}/(\text{SNR}+1) (Erez-Zamir form)s02
F\mathbf{F}MMSE-GDFE feed-forward filters02
R\mathbf{R}Upper-triangular matrix from QR decomposition of the augmented channels02
dβˆ—(r)d^*(r)Zheng-Tse DMT curve (ntβˆ’r)(nrβˆ’r)(n_t - r)(n_r - r)s03
Ξ³c(Ξ›)\gamma_c(\Lambda)Coding gain of lattice Ξ›\Lambda over Zn\mathbb{Z}^ns04
E8E_8Gosset lattice in R8\mathbb{R}^8 (densest packing in 8D; kissing number 240)s04
Ξ›24\Lambda_{24}Leech lattice in R24\mathbb{R}^{24} (densest packing in 24D; kissing number 196560)s04