Prerequisites

Before You Begin

This chapter builds on linear algebra and optimisation (Chapters 1 and 3), information-theoretic capacity of fading channels (Chapter 11), OFDM fundamentals (Chapter 14), and multi-user MIMO or network foundations from Chapter 19. The reader should be comfortable with convex optimisation, water-filling, ergodic capacity, and the basics of OFDM subcarrier structure.

  • Convex optimisation, KKT conditions, and water-filling(Review ch03)

    Self-check: Can you solve a power allocation problem of the form maxβ‘βˆ‘klog⁑(1+pkhk)\max \sum_{k} \log(1 + p_k h_k) subject to βˆ‘kpk≀P\sum_k p_k \leq P using the KKT conditions and state the water-filling solution pk=(ΞΌβˆ’1/hk)+p_k = (\mu - 1/h_k)^+?

  • Ergodic and outage capacity of fading channels(Review ch11)

    Self-check: Can you write the ergodic capacity C=Eh[log⁑2(1+SNRβ€‰βˆ£h∣2)]C = \mathbb{E}_h[\log_2(1 + \text{SNR}\,|h|^2)] for a Rayleigh fading channel and explain the difference between ergodic capacity and Ξ΅\varepsilon-outage capacity?

  • OFDM modulation, subcarrier structure, and cyclic prefix(Review ch14)

    Self-check: Can you explain how OFDM converts a frequency-selective channel into NN parallel flat-fading subchannels and state the per-subcarrier signal model Yn=HnXn+WnY_n = H_n X_n + W_n?

  • Multi-user systems and interference management basics(Review ch19)

    Self-check: Can you describe the downlink broadcast channel model with KK users and explain why time-division among users is generally suboptimal compared to superposition coding?

  • Order statistics and extreme-value distributions(Review ch01)

    Self-check: Given KK i.i.d. random variables X1,…,XKX_1, \ldots, X_K with CDF F(x)F(x), can you write the CDF of the maximum X(K)=max⁑kXkX_{(K)} = \max_k X_k as F(K)(x)=[F(x)]KF_{(K)}(x) = [F(x)]^K and explain how the expected maximum grows with KK?

Chapter 20 Notation

Key symbols introduced or heavily used in this chapter.

SymbolMeaningIntroduced
KKNumber of users in the cells01
hk[t]h_k[t]Channel gain of user kk in time slot tt s01
Rk[t]R_k[t]Instantaneous achievable rate of user kk in slot tt: Rk[t]=log⁑2(1+SNRβ€‰βˆ£hk[t]∣2)R_k[t] = \log_2(1 + \text{SNR}\,|h_k[t]|^2) s01
Tˉk[t]\bar{T}_k[t]Exponentially weighted moving-average throughput of user kks02
NNNumber of OFDMA subcarrierss03
Ο€(n)\pi(n)User assigned to subcarrier nn in the OFDMA allocations03
pk,np_{k,n}Power allocated to user kk on subcarrier nns03
Ξ³k\gamma_kPost-equalisation SINR reported by user kk (CQI)s04
Ξ±\alphaFairness parameter in the Ξ±\alpha-fair utility UΞ±(x)=x1βˆ’Ξ±/(1βˆ’Ξ±)U_\alpha(x) = x^{1-\alpha}/(1-\alpha) s02
Ξ”\DeltaFrequency reuse factor in ICICs05
PPTotal transmit power budget at the base stations01
BLER\text{BLER}Block error rate after decodings04