Prerequisites

Before You Begin

This chapter builds on linear algebra (Chapter 1), information-theoretic capacity (Chapter 11), MIMO channel capacity and water-filling (Chapter 15), and single-user MIMO transceiver architectures including precoding and MMSE-SIC (Chapter 16). Familiarity with convex optimisation, the matrix inversion lemma, and dirty paper coding concepts is essential.

  • Matrix inversions, pseudo-inverses, and the Woodbury identity(Review ch01)

    Self-check: Can you compute the Moore-Penrose pseudo-inverse H†=HH(HHH)βˆ’1\mathbf{H}^\dagger = \mathbf{H}^{H}(\mathbf{H}\mathbf{H}^{H})^{-1} and apply the Woodbury identity (A+UBV)βˆ’1(\mathbf{A} + \mathbf{U}\mathbf{B}\mathbf{V})^{-1} to simplify expressions involving rank-one updates?

  • Gaussian channel capacity and mutual information(Review ch11)

    Self-check: Can you derive the capacity of the AWGN channel C=log⁑2(1+SNR)C = \log_2(1 + \text{SNR}) and explain the role of the water-filling power allocation in parallel Gaussian channels?

  • MIMO capacity, SVD decomposition, and eigenmode transmission(Review ch15)

    Self-check: Can you state the MIMO capacity formula C=log⁑2det⁑(I+SNRNtHHH)C = \log_2 \det(\mathbf{I} + \frac{\text{SNR}}{N_t}\mathbf{H}\mathbf{H}^{H}) and decompose the MIMO channel into parallel eigenmodes via the SVD?

  • Linear precoding (MRT, ZF, MMSE) and MMSE-SIC capacity achievement(Review ch16)

    Self-check: Can you design a ZF precoder W=HH(HHH)βˆ’1\mathbf{W} = \mathbf{H}^{H}(\mathbf{H}\mathbf{H}^{H})^{-1} and explain why MMSE-SIC achieves the MIMO channel capacity regardless of decoding order?

  • Dirty paper coding (Costa theorem) and BC-MAC duality concepts(Review ch16)

    Self-check: Can you state Costa's theorem β€” that known interference at the transmitter does not reduce capacity β€” and explain its role in achieving the broadcast channel capacity?

Chapter 17 Notation

Key symbols introduced or heavily used in this chapter.

SymbolMeaningIntroduced
KKNumber of users in the multi-user systems01
NtN_tNumber of transmit (base-station) antennass01
NrN_rNumber of receive (base-station) antennas in the MACs01
hk\mathbf{h}_kChannel vector for user kk (NtΓ—1N_t \times 1 or NrΓ—1N_r \times 1)s01
H\mathbf{H}Aggregate channel matrix [h1,…,hK]H[\mathbf{h}_1, \ldots, \mathbf{h}_K]^Hs01
R\mathcal{R}Capacity region (set of achievable rate tuples)s01
PPTotal transmit power (sum power constraint)s02
PkP_kTransmit power of user kks01
wk\mathbf{w}_kBeamforming/precoding vector for user kks03
W\mathbf{W}Precoding matrix [w1,…,wK][\mathbf{w}_1, \ldots, \mathbf{w}_K]s03
RkR_kAchievable rate for user kks01
DoF\text{DoF}Degrees of freedom (pre-log factor of capacity at high SNR)s05
Οƒ2\sigma^2Noise variance per receive antennas01