Chapter Summary
Chapter 4 Summary: Achievable Rate Analysis
Key Points
- 1.
The use-and-then-forget (UatF) bound provides a tractable lower bound on the achievable rate by treating the channel estimate as deterministic and absorbing estimation error into worst-case Gaussian noise, yielding closed-form SINR expressions that become tight under channel hardening.
- 2.
MRC combining achieves SINR that grows linearly with but is interference-limited: the denominator is independent of , and multi-user interference does not vanish even with infinitely many antennas.
- 3.
ZF combining eliminates inter-user interference (from estimated channels) at the cost of spatial degrees of freedom, yielding an effective array gain of and a noise-limited (rather than interference-limited) rate expression.
- 4.
MMSE combining optimally balances noise enhancement and interference suppression, achieving the highest rate among linear receivers; its large-system behavior is characterized via random matrix theory (Stieltjes transform of the Marchenko-Pastur distribution).
- 5.
Sum rate scaling: MRC achieves , while ZF and MMSE achieve with optimal user loading, confirming that massive MIMO delivers spatial multiplexing gain proportional to the number of antennas.
- 6.
Power scaling: all three schemes support transmit power reduction as (exponent ) with no rate loss in the single-cell case — the array gain perfectly compensates the reduced power, enabling green communication.
- 7.
Pilot contamination from other cells creates a finite rate ceiling that does not vanish with and reduces the power scaling exponent to , motivating the pilot decontamination techniques of Chapter 3.
Looking Ahead
Chapter 5 turns the rate expressions developed here into a design tool by addressing power control and resource allocation. Given the closed-form SINR formulas, how should the base station allocate power across users to maximize fairness, sum rate, or energy efficiency? We will see that the UatF rate expressions — being concave in the power variables — lead to convex optimization problems with efficient solutions.