Prerequisites

Before You Begin

This chapter builds on linear algebra (Chapter 1), OFDM modulation (Chapter 4), random processes and noise (Chapter 8), and information-theoretic capacity (Chapter 11). The reader should be familiar with the concept of bandwidth, power spectral density, the Gaussian channel capacity formula, and basic probability including Poisson processes. Knowledge of multi-user MIMO (Chapter 17) is helpful but not strictly required.

  • Orthogonal bases and inner products(Review ch01)

    Self-check: Can you verify that two vectors ci,cj\mathbf{c}_i, \mathbf{c}_j of length NN are orthogonal by checking ciHcj=0\mathbf{c}_i^H \mathbf{c}_j = 0, and explain what happens when they are not?

  • OFDM and multi-carrier modulation(Review ch04)

    Self-check: Can you describe how OFDM divides a wideband channel into NN narrow orthogonal subcarriers and explain the role of the cyclic prefix in eliminating inter-carrier interference?

  • Spectral characterisation of random processes(Review ch08)

    Self-check: Can you define the power spectral density of a wide-sense stationary process and relate it to the autocorrelation function via the Wiener-Khinchin theorem?

  • Channel capacity and the water-filling solution(Review ch11)

    Self-check: Can you state the Gaussian channel capacity C=Wlog⁑2(1+SNR)C = W\log_2(1 + \text{SNR}) and explain how water-filling allocates power across parallel sub-channels to maximise the total rate?

  • Multi-user information theory basics(Review ch11)

    Self-check: Can you describe the multiple-access channel (MAC) capacity region for two users and explain why the sum-rate point requires successive decoding rather than treating interference as noise?

Chapter 19 Notation

Key symbols introduced or heavily used in this chapter.

SymbolMeaningIntroduced
KKNumber of users sharing the channels01
WWTotal system bandwidth (Hz)s01
TTFrame duration (seconds)s01
PPTotal transmit power budgets01
PkP_kTransmit power allocated to user kks01
RkR_kAchievable rate of user kk (bits/s/Hz)s01
NNProcessing gain (spreading factor) in CDMAs03
ck\mathbf{c}_kSpreading code vector for user kks03
GGOffered load (Erlangs) in random accesss04
SSThroughput of random access protocols04
TcT_cCoherence time (in symbols)s05
MMNumber of base-station antennass05
Οƒ2\sigma^2Noise variances01
∣hk∣2|h_k|^2Channel power gain for user kks01