Motivating the Tradeoff: Diversity vs Multiplexing

Two High-SNR Resources, One Channel

An ntΓ—nrn_t \times n_r block-fading MIMO channel offers the designer two distinct asymptotic resources at high SNR, and they are not the same thing.

Resource 1 β€” Diversity. At a fixed target rate RR, the outage probability decays polynomially in SNR: Pout(R)≐SNRβˆ’dP_{\rm out}(R) \doteq \text{SNR}^{-d}. The exponent dd is the diversity order, and it measures the reliability slope of the communication link on a log-log BER-vs-SNR plot at high SNR. Alamouti on an nrn_r-receive channel achieves the maximum d=2nrd = 2 n_r on a 2Γ—nr2 \times n_r channel (Chapter 11); V-BLAST with zero-forcing achieves only d=nrβˆ’nt+1d = n_r - n_t + 1. Both operate at a fixed rate.

Resource 2 β€” Multiplexing. At scaling target rate R(SNR)=rlog⁑2SNR+o(log⁑SNR)R(\text{SNR}) = r \log_2 \text{SNR} + o(\log \text{SNR}), the rate itself grows with the log-SNR at slope rr. The pre-log slope rr is the multiplexing gain, and it measures the capacity slope of the link. Telatar's MIMO capacity theorem (Chapter 10) says that the ergodic capacity of an ntΓ—nrn_t \times n_r Rayleigh channel grows like min⁑(nt,nr)log⁑2SNR\min(n_t, n_r) \log_2 \text{SNR}, so the maximum multiplexing gain is rmax⁑=min⁑(nt,nr)r_{\max} = \min(n_t, n_r). V-BLAST with ML detection achieves this maximum; Alamouti, transmitting at fixed rate 1, achieves only r=0r = 0.

The point is that Alamouti and V-BLAST are not comparable on the same axis: Alamouti is a full-diversity-zero-multiplexing code, while V-BLAST is a full-multiplexing-low-diversity scheme. To compare them fairly we need a single performance curve that varies rate with SNR and measures both resources simultaneously. That curve is the Zheng-Tse diversity-multiplexing tradeoff dβˆ—(r)d^*(r), which we define in this section and derive in Β§2.

The central insight: diversity and multiplexing are not independent design choices. Zheng and Tse (2003) showed that they trade off along a precise piecewise-linear curve dβˆ—(r)=(ntβˆ’r)(nrβˆ’r)d^*(r) = (n_t - r)(n_r - r) β€” this is the fundamental constraint that every space-time code designer navigates.

,

Definition:

Exponential Equality ≐\doteq

Let f(SNR)f(\text{SNR}) and g(SNR)g(\text{SNR}) be two positive functions of SNR. We write f(SNR)≐g(SNR)f(\text{SNR}) \doteq g(\text{SNR}), and say that ff is exponentially equal to gg, if lim⁑SNRβ†’βˆžlog⁑f(SNR)log⁑SNRβ€…β€Š=β€…β€Šlim⁑SNRβ†’βˆžlog⁑g(SNR)log⁑SNR.\lim_{\text{SNR}\to\infty} \frac{\log f(\text{SNR})}{\log \text{SNR}} \;=\; \lim_{\text{SNR}\to\infty} \frac{\log g(\text{SNR})}{\log \text{SNR}}. Equivalently, f(SNR)≐SNRaf(\text{SNR}) \doteq \text{SNR}^{a} iff lim⁑SNRβ†’βˆžlog⁑f(SNR)/log⁑SNR=a\lim_{\text{SNR}\to \infty} \log f(\text{SNR}) / \log \text{SNR} = a. The exponent aa is the only feature of ff that survives the limit.

What ≐\doteq ignores:

  • Multiplicative constants: cβ‹…SNRa≐SNRac \cdot \text{SNR}^{a} \doteq \text{SNR}^{a} for any constant c>0c > 0.
  • Polylogarithmic prefactors: (log⁑SNR)kβ‹…SNRa≐SNRa(\log \text{SNR})^k \cdot \text{SNR}^{a} \doteq \text{SNR}^{a} for any kk.
  • Lower-order polynomial corrections: SNRa+SNRaβˆ’1≐SNRa\text{SNR}^{a} + \text{SNR}^{a-1} \doteq \text{SNR}^{a}.

What ≐\doteq keeps: only the leading polynomial order. The relations \dotle\dotle ("≀\le" exponentially) and \dotge\dotge are defined analogously.

The DMT is an asymptotic statement β€” it is exact only in the limit SNRβ†’βˆž\text{SNR} \to \infty. At finite SNR, the coding gain (the multiplicative constant in front of SNRβˆ’d\text{SNR}^{-d}) matters just as much as the diversity exponent, and two codes with the same DMT can differ by 3–6 dB in actual performance. Chapter 13 constructs the CDA / Golden-code family which has both optimal DMT and good coding gain.

,

Definition:

Multiplexing Gain rr

Consider a family of codes {CSNR}\{\mathcal{C}_{\text{SNR}}\} indexed by SNR, with CSNR\mathcal{C}_{\text{SNR}} operating at rate R(SNR)R(\text{SNR}) bits per channel use. The multiplexing gain of the family is rβ€…β€Š=β€…β€Šlim⁑SNRβ†’βˆžR(SNR)log⁑2SNR.r \;=\; \lim_{\text{SNR}\to\infty} \frac{R(\text{SNR})}{\log_2 \text{SNR}}. Operationally, rr is the slope at which the code's rate grows with the log-SNR as SNR increases. A code with fixed rate R(SNR)=R0R(\text{SNR}) = R_0 has multiplexing gain r=0r = 0; a code with R(SNR)=2log⁑2SNRR(\text{SNR}) = 2 \log_2 \text{SNR} has r=2r = 2.

For an ntΓ—nrn_t \times n_r i.i.d. Rayleigh channel, Telatar's MIMO capacity theorem (Chapter 10) gives CΛ‰(SNR)=min⁑(nt,nr)log⁑2SNR+O(1)\bar C(\text{SNR}) = \min(n_t, n_r) \log_2 \text{SNR} + O(1) at high SNR. A reliable family of codes must therefore satisfy rβ€…β€Šβ‰€β€…β€Šmin⁑(nt,nr).r \;\le\; \min(n_t, n_r). The upper bound rmax⁑=min⁑(nt,nr)r_{\max} = \min(n_t, n_r) is the number of spatial degrees of freedom of the channel; it is achieved by any family whose rate matches the capacity slope.

,

Definition:

Diversity Gain dβˆ—d^*

Consider a family of codes {CSNR}\{\mathcal{C}_{\text{SNR}}\} operating at rate R(SNR)R(\text{SNR}) with block error probability Pe(SNR)P_e(\text{SNR}) under ML decoding. The diversity gain of the family is dβˆ—β€…β€Š=β€…β€Šβˆ’lim⁑SNRβ†’βˆžlog⁑Pe(SNR)log⁑SNR.d^* \;=\; -\lim_{\text{SNR}\to\infty} \frac{\log P_e(\text{SNR})}{\log \text{SNR}}. Equivalently, Pe(SNR)≐SNRβˆ’dβˆ—P_e(\text{SNR}) \doteq \text{SNR}^{-d^*}.

For a fixed-rate family (r=0r = 0), dβˆ—d^* reduces to the classical diversity order of Chapters 10–11: the log-log slope of BER against SNR at high SNR. For a scaling-rate family (r>0r > 0), dβˆ—d^* is the exponent at which error probability still decays while the rate is growing β€” a subtler quantity, because it measures the joint reliability-and-rate scaling.

Outage lower bound. For any code, the block error probability is lower-bounded by the outage probability at the target rate: Pe(SNR)β€…β€Šβ‰₯β€…β€ŠPout(R(SNR)).P_e(\text{SNR}) \;\ge\; P_{\rm out}(R(\text{SNR})). So the diversity gain of any family is bounded by the outage-diversity exponent, dβˆ—β€…β€Šβ‰€β€…β€Šβˆ’lim⁑SNRβ†’βˆžlog⁑Pout(rlog⁑2SNR)log⁑SNRβ€…β€Š=:β€…β€Šdoutβˆ—(r).d^* \;\le\; -\lim_{\text{SNR}\to\infty} \frac{\log P_{\rm out}(r \log_2 \text{SNR})}{\log \text{SNR}} \;=:\; d^*_{\rm out}(r). The Zheng-Tse theorem of Β§2 shows that this outage-diversity exponent is achievable β€” and hence equal to dβˆ—(r)d^*(r) β€” by a Gaussian random codebook, so dβˆ—(r)=doutβˆ—(r)d^*(r) = d^*_{\rm out}(r).

,

Alamouti at (1,4)(1,4), V-BLAST at (2,d)(2, d) β€” Where Is the Fair Comparison?

On a 2Γ—22 \times 2 MIMO channel, Alamouti and V-BLAST produce very different (r,d)(r, d) operating points:

  • Alamouti at rate 11 bit/use: transmits one symbol per channel use on average (two symbols over two channel uses). The rate is fixed in SNR, so rAlamouti=0r_{\rm Alamouti} = 0. The diversity order is d=ntnr=4d = n_t n_r = 4. Operating point: (0,4)(0, 4).

  • V-BLAST with ML detection at rate R(SNR)=2log⁑2SNRR(\text{SNR}) = 2 \log_2 \text{SNR}: transmits two independent streams, one per antenna; rate grows at slope 22. So rVBLAST=2r_{\rm VBLAST} = 2. The diversity order at this rate, under ML detection, is d=1d = 1 (the worst-case eigenvalue of HHH\mathbf{H}\mathbf{H}^{H} fades independently with exponent 11). Operating point: (2,1)(2, 1).

  • V-BLAST with zero-forcing at rate R(SNR)=2log⁑2SNRR(\text{SNR}) = 2 \log_2 \text{SNR}: same r=2r = 2, but each spatial stream sees a post-ZF effective SNR that is limited by the weakest eigenvalue; the ZF diversity per stream is nrβˆ’nt+1=1n_r - n_t + 1 = 1. Operating point: (2,1)(2, 1) (same as V-BLAST-ML at r=2r = 2, but worse coding gain at finite SNR).

These two codes are NOT competitors on the same plot β€” they are sitting at two ends of an implicit curve. What is the curve? Is Alamouti actually the best achievable at r=0r = 0? Is V-BLAST the best at r=2r = 2? Or can a single code hit (1,d)(1, d) for some interior d>0d > 0? The Zheng-Tse theorem of Β§2 answers all three questions with a single closed- form formula.

,

Empirical DMT: βˆ’log⁑Pout/log⁑SNR-\log P_{\rm out}/\log \text{SNR} Converges to dβˆ—(r)d^*(r)

This plot shows the empirical outage-diversity exponent dempirical(SNR)=βˆ’log⁑Pout(rlog⁑2SNR)/log⁑SNRd_{\rm empirical}(\text{SNR}) = -\log P_{\rm out}(r \log_2 \text{SNR}) / \log \text{SNR} as a function of SNR, for a chosen multiplexing gain rr and MIMO dimensions (nt,nr)(n_t, n_r). As SNRβ†’βˆž\text{SNR} \to \infty, the empirical exponent converges to the Zheng-Tse exponent dβˆ—(r)=(ntβˆ’r)(nrβˆ’r)d^*(r) = (n_t - r)(n_r - r). At moderate SNR the curve deviates β€” sometimes significantly β€” from the asymptote, which is the practical caveat of all DMT statements: the DMT is a high-SNR statement, and even "high SNR" in simulations typically means SNRβ‰₯20\text{SNR} \ge 20 dB. The convergence rate itself depends on (nt,nr,r)(n_t, n_r, r) β€” the r=0r = 0 corner converges fastest, the r=min⁑(nt,nr)r = \min(n_t, n_r) corner slowest.

Parameters
2
2
1

Example: DMT of the Scalar Rayleigh Channel (nt=nr=1n_t = n_r = 1)

Compute the DMT curve dβˆ—(r)d^*(r) for the scalar nt=nr=1n_t = n_r = 1 Rayleigh channel with coherent detection and a single complex symbol per channel use. Verify the general formula dβˆ—(r)=(ntβˆ’r)(nrβˆ’r)d^*(r) = (n_t - r)(n_r - r).

,

Historical Note: Foschini 1996: V-BLAST and the Birth of Spatial Multiplexing

1996

Gerard Foschini's 1996 Bell Labs Technical Journal paper, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas", introduced what is today called V-BLAST (Vertical Bell Labs Layered Space-Time): transmit ntn_t independent data streams over ntn_t antennas and recover them at the receiver via successive interference cancellation.

Foschini's revolutionary claim β€” contrary to the then-prevailing wisdom of Alamouti-style repetition β€” was that MIMO channels support rate growth proportional to min⁑(nt,nr)\min(n_t, n_r), not merely improved reliability at fixed rate. This is the spatial multiplexing concept: the channel has multiple independent spatial dimensions, and a clever transmitter should use them all to carry independent data rather than repeat the same data with diversity.

The 1998 Wolniansky-Foschini-Golden-Valenzuela prototype (the "V-BLAST demonstration" at Bell Labs, Holmdel) experimentally confirmed the theoretical predictions on an indoor 4Γ—44 \times 4 MIMO channel at 36 bps/Hz β€” an order of magnitude above single-antenna Shannon capacity at the same SNR.

The tension between Alamouti (full diversity, rate 1) and V-BLAST (full multiplexing, rate min⁑(nt,nr)\min(n_t, n_r)) persisted for five years until Zheng and Tse's 2003 paper resolved it by showing that both are corner points of a single tradeoff curve.

,

Quick Check

A family of codes operates at rate R(SNR)=2log⁑2SNRR(\text{SNR}) = 2 \log_2 \text{SNR} bits per channel use on a 4Γ—44 \times 4 i.i.d. Rayleigh MIMO channel. Its multiplexing gain rr is:

r=0r = 0 (because the family is fixed-rate)

r=2r = 2 (the pre-log slope)

r=4r = 4 (the full spatial degrees of freedom)

rr depends on the family's error probability, not the rate

Common Mistake: ≐\doteq Is Not == β€” Constants and Polylogs Are Invisible

Mistake:

Reading Pout(R)≐SNRβˆ’dP_{\rm out}(R) \doteq \text{SNR}^{-d} as Pout(R)=Cβ‹…SNRβˆ’dP_{\rm out}(R) = C \cdot \text{SNR}^{-d} for some explicit constant CC (so e.g. concluding that two codes with the same DMT have identical outage probabilities at every SNR).

Correction:

The exponential-equality relation ≐\doteq only captures the leading polynomial order. Two codes with the same DMT β€” e.g., Alamouti and the Golden code at r=1r = 1 on 2Γ—22 \times 2 β€” generally have different multiplicative constants in front of SNRβˆ’dβˆ—\text{SNR}^{-d^*}. Those constants translate into dB offsets of the BER-vs-SNR curve: the Golden code is typically ∼3\sim 3–44 dB better than Alamouti at rate 22 bits/use on 2Γ—22 \times 2, even though both have diversity order 22 at r=1r = 1. The coding-gain gap is invisible to ≐\doteq.

Rule of thumb. Use the DMT as a first-order design criterion to choose the code's asymptotic operating point. Use finite-SNR Monte Carlo (or the determinant criterion of Chapter 11) to choose between codes with the same DMT. Both analyses are necessary; neither is sufficient alone.

Diversity Gain

The exponent dβˆ—d^* at which a code family's block error probability decays polynomially in SNR at high SNR: Pe(SNR)≐SNRβˆ’dβˆ—P_e(\text{SNR}) \doteq \text{SNR}^{-d^*}. For fixed-rate families, dβˆ—d^* coincides with the classical diversity order of Chapters 10–11. For scaling-rate families with multiplexing gain rr, dβˆ—d^* is a function of rr called the DMT.

Related: Multiplexing Gain rr, DMT Slope and Segment Structure, Outage Probability and Ο΅\epsilon-Outage Capacity

Multiplexing Gain

The pre-log slope r=lim⁑R(SNR)/log⁑2SNRr = \lim R(\text{SNR}) / \log_2 \text{SNR} at which a code family's rate grows with log-SNR. The maximum on an ntΓ—nrn_t \times n_r i.i.d. Rayleigh channel is rmax⁑=min⁑(nt,nr)r_{\max} = \min(n_t, n_r), equal to the spatial degrees of freedom.

Related: Diversity Gain dβˆ—d^*, DMT Slope and Segment Structure, Spatial Multiplexing

Exponential Equality (≐\doteq)

Two positive functions of SNR are exponentially equal, f≐gf \doteq g, if lim⁑log⁑f/log⁑SNR=lim⁑log⁑g/log⁑SNR\lim \log f / \log \text{SNR} = \lim \log g / \log \text{SNR}. Only the leading polynomial order is kept; multiplicative constants, polylog prefactors, and lower-order terms are ignored. Central to the DMT framework.

Related: DMT Slope and Segment Structure, Asymptotic Analysis