Prerequisites & Notation

Before You Begin

This chapter analyzes the design of distributed MIMO systems under finite-capacity fronthaul links. The material builds on the cell-free architecture from Chapters 11--13 and requires familiarity with rate-distortion theory and quantization from information theory.

  • Cell-free massive MIMO architecture and user-centric clustering(Review ch11, ch12)

    Self-check: Can you describe the difference between full cell-free and user-centric cell-free?

  • Distributed processing levels 1--4 and local MMSE combining(Review ch13)

    Self-check: Can you explain the fronthaul overhead difference between Level 1 and Level 4 cooperation?

  • Linear precoding and achievable rates: MRT, ZF, MMSE(Review ch06)

    Self-check: Can you write the ZF precoder W=H(HHH)βˆ’1\mathbf{W} = \mathbf{H}(\mathbf{H}^{H} \mathbf{H})^{-1} and explain its rate expression?

  • Rate-distortion theory and source coding(Review ch09)

    Self-check: Can you state the rate-distortion function for a Gaussian source?

  • Achievable rate analysis with the UatF bound(Review ch04)

    Self-check: Can you explain why the use-and-then-forget bound is tractable for imperfect CSI?

Notation for This Chapter

Symbols introduced in this chapter. See also the global notation table.

SymbolMeaningIntroduced
CfhC_{\text{fh}}Fronthaul capacity per access point (bits/s or bits/symbol)s01
y^l\hat{\mathbf{y}}_lQuantized received signal at AP lls02
ql\mathbf{q}_lQuantization noise at AP lls02
Rq\mathbf{R}_qQuantization noise covariance matrixs02
s^k\hat{s}_kCompressed precoded signal for user kks03
LLNumber of access points (APs)s01
KKNumber of userss01
Hlk\mathbf{H}_{lk}Channel vector from user kk to AP lls01
Ξ·l\eta_lFronthaul load factor at AP ll (fraction of capacity used)s04
flf_lComputation resource allocated to AP ll (FLOPS)s04