Part 3: Space-Time Coding

Chapter 12: The Diversity-Multiplexing Tradeoff

Advanced~260 min

Learning Objectives

  • State the asymptotic definitions of diversity gain dβˆ—d^* and multiplexing gain rr for a MIMO block-fading channel, and explain why they are the two natural high-SNR resources competing inside the outage-probability exponent
  • Prove the Zheng-Tse theorem: for an ntΓ—nrn_t \times n_r i.i.d. Rayleigh channel with block length Lβ‰₯nt+nrβˆ’1L \ge n_t + n_r - 1, the diversity-multiplexing tradeoff curve is the piecewise-linear interpolation dβˆ—(r)=(ntβˆ’r)(nrβˆ’r)d^*(r) = (n_t - r)(n_r - r), r∈{0,1,…,min⁑(nt,nr)}r \in \{0, 1, \ldots, \min(n_t, n_r)\}
  • Interpret the DMT as the fundamental constraint every space-time code designer navigates: every unit of multiplexing gain costs diversity, and the cost function is quadratic at the endpoints and linear between corner points
  • Classify the classical space-time codes by their (r,d)(r, d) operating points on the DMT curve: Alamouti at (1,2nr)(1, 2 n_r), V-BLAST-ZF at (min⁑(nt,nr),nrβˆ’nt+1)(\min(n_t, n_r), n_r - n_t + 1), V-BLAST-ML at (min⁑(nt,nr),nr)(\min(n_t, n_r), n_r), and the Golden / CDA codes as DMT-optimal for all rr
  • Refine the basic DMT statement for short block length L<nt+nrβˆ’1L < n_t + n_r - 1 (tradeoff truncation) and for spatially correlated fading (coding-gain reduction without DMT-exponent loss for full-rank correlation)
  • Use the exponential-equality notation ≐\doteq fluently and distinguish DMT statements (asymptotic exponents) from finite-SNR statements (coding gains, moderate-SNR slopes)

Sections

Prerequisites

πŸ’¬ Discussion

Loading discussions...