Prerequisites

Before You Begin

This chapter builds on linear algebra (Chapter 1), antenna array fundamentals (Chapter 7), MIMO capacity (Chapter 15), and multi-user MIMO (Chapter 17). Familiarity with the law of large numbers, random matrix theory basics, and linear MIMO receivers (ZF, MMSE) is essential. The reader should be comfortable with asymptotic analysis and matrix inverse identities.

  • Matrix inverses, trace, and determinant identities(Review ch01)

    Self-check: Can you apply the matrix inversion lemma (A+uvH)βˆ’1=Aβˆ’1βˆ’Aβˆ’1uvHAβˆ’11+vHAβˆ’1u(\mathbf{A} + \mathbf{u}\mathbf{v}^H)^{-1} = \mathbf{A}^{-1} - \frac{\mathbf{A}^{-1}\mathbf{u}\mathbf{v}^H\mathbf{A}^{-1}}{1+\mathbf{v}^H\mathbf{A}^{-1}\mathbf{u}} and state the relationship between tr(AB)\text{tr}(\mathbf{A}\mathbf{B}) and tr(BA)\text{tr}(\mathbf{B}\mathbf{A})?

  • Antenna arrays and beamforming fundamentals(Review ch07)

    Self-check: Can you express the array response vector a(ΞΈ)=[1,ej2Ο€dsin⁑θ/Ξ»,…]T\mathbf{a}(\theta) = [1, e^{j2\pi d\sin\theta/\lambda}, \ldots]^T for a uniform linear array and explain how the beamwidth narrows as the number of elements MM increases?

  • MIMO channel capacity and spatial multiplexing(Review ch15)

    Self-check: Can you write the ergodic MIMO capacity C=E ⁣[log⁑2det⁑ ⁣(I+SNRNtHHH)]C = \mathbb{E}\!\left[\log_2\det\!\left(\mathbf{I} + \frac{\text{SNR}}{N_t}\mathbf{H}\mathbf{H}^{H}\right)\right] and explain why the capacity grows linearly with min⁑(Nt,Nr)\min(N_t, N_r) at high SNR?

  • Multi-user MIMO precoding and detection(Review ch17)

    Self-check: Can you describe ZF precoding in the downlink W=HH(HHH)βˆ’1\mathbf{W} = \mathbf{H}^{H}(\mathbf{H}\mathbf{H}^{H})^{-1} and explain why it eliminates inter-user interference when the base station has full CSI?

  • Law of large numbers and concentration inequalities(Review ch01)

    Self-check: Can you state the strong law of large numbers for i.i.d. random variables and explain why 1Mβˆ‘m=1M∣hm∣2β†’1\frac{1}{M}\sum_{m=1}^{M}|h_m|^2 \to 1 almost surely when hm∼CN(0,1)h_m \sim \mathcal{CN}(0,1)?

Chapter 18 Notation

Key symbols introduced or heavily used in this chapter.

SymbolMeaningIntroduced
MMNumber of base-station (BS) antennass01
KKNumber of single-antenna userss01
hk\mathbf{h}_kChannel vector from user kk to the BS (MΓ—1M \times 1) s01
H\mathbf{H}Channel matrix [h1,…,hK]∈CMΓ—K[\mathbf{h}_1, \ldots, \mathbf{h}_K] \in \mathbb{C}^{M \times K} s01
Ξ²k\beta_kLarge-scale fading coefficient (path loss + shadowing) for user kks01
gk\mathbf{g}_kSmall-scale fading vector: hk=Ξ²k gk\mathbf{h}_k = \sqrt{\beta_k}\,\mathbf{g}_k s01
h^k\hat{\mathbf{h}}_kMMSE channel estimate for user kks03
Ο„p\tau_pPilot sequence length (in symbols)s04
pkp_kTransmit power of user kks05
EE\text{EE}Energy efficiency (bits/joule)s07
Οƒ2\sigma^2Noise variance per BS antennas01
LLNumber of cells in the multi-cell models04