Code Operating Points on the DMT

Classifying Space-Time Codes by Their DMT Operating Point

Every space-time code C\mathcal{C} has a natural DMT operating trace: operate it at rate R(SNR)=rlog2SNRR(\text{SNR}) = r \log_2 \text{SNR} and compute its achieved diversity gain dC(r)d_{\mathcal{C}}(r). The result is a function rdC(r)r \mapsto d_{\mathcal{C}}(r) that lies on or below the DMT curve d(r)d^*(r). A code is DMT-optimal if dC(r)=d(r)d_{\mathcal{C}}(r) = d^*(r) for all r[0,rmax]r \in [0, r_{\max}].

In this section we classify the main space-time codes of Chapter 11 by their DMT operating traces:

  • Alamouti sits at a single corner (1,2nr)(1, 2 n_r) on an nt=2n_t = 2 channel — full diversity, but rate fixed at 11 bit/use so it cannot be operated at any r>1r > 1 with diversity.
  • V-BLAST with zero-forcing on an nrntn_r \ge n_t channel sits at the opposite corner (rmax,nrnt+1)(r_{\max}, n_r - n_t + 1) — full multiplexing, low diversity per stream.
  • V-BLAST with ML detection lifts the ZF diversity to nrn_r but still does not reach d(r)d^*(r) for intermediate rr.
  • The Golden code (and more generally the CDA / Perfect codes of Chapter 13) is DMT-optimal on 2×22 \times 2: it achieves d(r)d^*(r) for every r[0,2]r \in [0, 2].
  • D-BLAST with an outer code is DMT-optimal for arbitrary nt×nrn_t \times n_r, but impractical due to diagonal layering.

The message: most classical space-time codes are not DMT-optimal. Achieving the full DMT curve requires the algebraic constructions of Chapter 13. Until those are introduced, we describe the sub-optimal corner-hugging behaviour of Alamouti and V-BLAST — and motivate the need for better codes.

,

Definition:

DMT-Optimal Code

A family of space-time codes {CSNR}\{\mathcal{C}_{\text{SNR}}\} with per- symbol rate R(SNR)=rlog2SNRR(\text{SNR}) = r \log_2 \text{SNR} is DMT-optimal if its achieved diversity gain equals the Zheng-Tse exponent: dC(r)  =  d(r)  =  (ntr)(nrr)at integer corners r{0,1,,min(nt,nr)},d_{\mathcal{C}}(r) \;=\; d^*(r) \;=\; (n_t - r)(n_r - r) \quad \text{at integer corners } r \in \{0, 1, \ldots, \min(n_t, n_r)\}, with the piecewise-linear interpolation achieved by time-sharing. A code is DMT-optimal at a single rate rr if it achieves d(r)d^*(r) at that specific rr but not elsewhere.

The distinction matters because most classical codes are single-point optimal: Alamouti is DMT-optimal at r=0r = 0 only, V-BLAST-ML is DMT- optimal at r=rmaxr = r_{\max} only. Achieving every point on the DMT curve with a single coding scheme — as opposed to time-sharing between rate-specific codes — is the design problem that the CDA / Golden-code family solves (Chapter 13).

,

Theorem: DMT of Alamouti on 2×nr2 \times n_r

The Alamouti scheme transmits 22 complex symbols (s1,s2)(s_1, s_2) over a 2×22 \times 2 space-time codeword matrix, achieving rate R=log2MR = \log_2 M bits per channel use for MM-QAM. Its DMT operating trace is dAlamouti(r)  =  2nr(1r)+,r[0,1].d_{\rm Alamouti}(r) \;=\; 2 n_r (1 - r)^+, \qquad r \in [0, 1]. Beyond r=1r = 1 the Alamouti rate cannot grow with SNR (the constellation is bounded) so dAlamouti(r)=0d_{\rm Alamouti}(r) = 0 for r>1r > 1.

At r=0r = 0 (fixed rate) Alamouti achieves the full diversity d(0)=2nrd^*(0) = 2 n_r — it is DMT-optimal at r=0r = 0. But for any r>0r > 0, dAlamouti(r)<d(r)d_{\rm Alamouti}(r) < d^*(r), so Alamouti is strictly sub-optimal off-corner.

Alamouti "consumes" both transmit antennas to send one information stream, which is then protected by the full 2×nr2 \times n_r diversity structure (rank-22 codeword difference matrix Δ\boldsymbol{\Delta}). At r=0r = 0 this is optimal — you cannot buy more diversity. At r>0r > 0 the scheme keeps paying for full diversity whether it needs it or not, and the rate scales only by the constellation growth. Since the effective scalar SNR on Alamouti's single-stream channel is SNR/2\text{SNR}/2, a QAM constellation with 2rlog2SNR=SNRr2^{r \log_2 \text{SNR}} = \text{SNR}^{r} points has outage probability SNR2nr(1r)\doteq \text{SNR}^{-2n_r(1 - r)}.

, ,

Theorem: DMT of V-BLAST: ZF, MMSE, and ML

Consider V-BLAST on an nt×nrn_t \times n_r i.i.d. Rayleigh channel with nrntn_r \ge n_t, transmitting ntn_t independent MM-QAM streams, one per transmit antenna. Its DMT operating trace depends on the receiver:

(i) V-BLAST with zero-forcing (ZF): dZF(r)=(nrnt+1) ⁣(1rnt)+,r[0,nt].d_{\rm ZF}(r) = (n_r - n_t + 1)\!\left(1 - \frac{r}{n_t}\right)^+, \qquad r \in [0, n_t]. At r=nt=rmaxr = n_t = r_{\max}, dZF=0d_{\rm ZF} = 0 (outage-limited). The max diversity is dZF(0)=nrnt+1d_{\rm ZF}(0) = n_r - n_t + 1.

(ii) V-BLAST with ML detection: dML(r)=nr ⁣(1rnt)+,r[0,nt].d_{\rm ML}(r) = n_r\!\left(1 - \frac{r}{n_t}\right)^+, \qquad r \in [0, n_t]. At r=ntr = n_t, dML=0d_{\rm ML} = 0; max diversity dML(0)=nrd_{\rm ML}(0) = n_r.

Both traces are straight lines from (0,drecv(0))(0, d_{\rm recv}(0)) to (nt,0)(n_t, 0) — chord approximations to the DMT curve. V-BLAST-ML achieves the DMT corner at r=rmaxr = r_{\max} but falls below the DMT curve at all interior rr. V-BLAST-ZF is further below.

ZF stream-by-stream detection diagonalises each stream's effective channel by projecting onto the null-space of the other streams. The post-ZF channel for stream kk sees only nrnt+1n_r - n_t + 1 spatial degrees of freedom (the remaining nt1n_t - 1 are used to null the interference). This is the diversity of the post-ZF scalar channel.

ML jointly detects all ntn_t streams, restoring the full receive- diversity nrn_r per stream (at the cost of exponential complexity). But even ML cannot lift V-BLAST off the chord because V-BLAST transmits uncoded data — there is no error-correcting structure across antennas. Without such structure, outage events on a subset of eigenvalues always cause block errors.

, ,

Space-Time Codes on the DMT Curve

Animated overlay of Alamouti, V-BLAST-ZF, V-BLAST-ML, and Golden code operating traces on the DMT curve for 2×22 \times 2 MIMO. Each code's rd(r)r \mapsto d(r) trace fills in one at a time, highlighting the corner point(s) it achieves and the gap to the full DMT curve. The Golden code, which hugs the curve over the entire range, is revealed last — the "winner" of the comparison.
Alamouti achieves d(0)=4d^*(0) = 4 (the r=0r = 0 corner) but loses diversity linearly with rr. V-BLAST-ZF gives a chord with slope 1/2-1/2 from (0,1)(0, 1) to (2,0)(2, 0). V-BLAST-ML lifts the chord to (0,2)(0, 2). Only the Golden code (Chapter 13) achieves the full piecewise-linear DMT curve (0,4)(1,1)(2,0)(0, 4) \to (1, 1) \to (2, 0).

Alamouti, V-BLAST, Golden on the DMT Curve

Overlay the DMT operating traces of Alamouti, V-BLAST (ZF and ML), and the Golden code on the Zheng-Tse curve d(r)d^*(r). For each (nt,nr)(n_t, n_r) configuration the plot shows:

  • Solid line — the full DMT curve d(r)d^*(r) (Zheng-Tse bound).
  • Dot and chord — Alamouti at (1,2nr)(1, 2 n_r) and its zero-rate chord.
  • Dashed line — V-BLAST ZF trace (nrnt+1)(1r/nt)+(n_r - n_t + 1)(1 - r/n_t)^+.
  • Dot-dashed line — V-BLAST ML trace nr(1r/nt)+n_r (1 - r/n_t)^+.
  • Golden code — achieves the full curve on 2×22 \times 2 (Ch. 13 preview).

Use this to see at a glance where each code sits below the DMT curve and how much reliability is lost compared to a DMT-optimal code.

Parameters
2
2

Example: V-BLAST-ML at r=2r = 2 on 4×44 \times 4

Compute the V-BLAST-ML diversity at multiplexing gain r=2r = 2 on a 4×44 \times 4 MIMO channel, and compare with the Zheng-Tse optimum d(2)=4d^*(2) = 4. How big is the gap?

,

Space-Time Codes on the DMT Curve

CodeChannelRate RRMux gain rrDiv dd achievedDMT opt?Section
Alamouti2×nr2 \times n_rfixed 1 bit/use002nr2 n_r = d(0)d^*(0)at r=0r = 0 onlyCh. 11
V-BLAST ZFnt×nrn_t \times n_r, nrntn_r \ge n_tntlog2Mn_t \log_2 Mntn_t at M=SNRM = \text{SNR}nrnt+1n_r - n_t + 1noCh. 11
V-BLAST MLnt×nrn_t \times n_r, nrntn_r \ge n_tntlog2Mn_t \log_2 Mntn_tnrn_rat r=ntr = n_t only (chord touches corner)Ch. 11
Golden code (2×2)2×22 \times 2rlog2SNRr \log_2 \text{SNR}any r[0,2]r \in [0, 2]d(r)d^*(r)YESCh. 13
Perfect codes (general)n×nn \times nrlog2SNRr \log_2 \text{SNR}any r[0,n]r \in [0, n]d(r)d^*(r)YESCh. 13
D-BLAST + outer codent×nrn_t \times n_rrlog2SNRr \log_2 \text{SNR}any rrd(r)d^*(r)YES (impractical)Ch. 11, 13
LAST codesnt×nrn_t \times n_rrlog2SNRr \log_2 \text{SNR}any rrd(r)d^*(r)YES (lattice)Ch. 17

Common Mistake: Alamouti Is Full-Diversity, Not DMT-Optimal

Mistake:

Concluding that because Alamouti achieves full diversity d=2nrd = 2 n_r, it must be DMT-optimal (or at least "optimal" in any meaningful sense) on a 2×nr2 \times n_r channel.

Correction:

Alamouti achieves full diversity 2nr2 n_r at rate r=0r = 0 only. At r>0r > 0 it cannot grow the rate with SNR (the QAM constellation grows geometrically while the diversity structure is fixed), so the operating point rides a chord from (0,2nr)(0, 2 n_r) to (1,0)(1, 0) that dips below the DMT curve for any r(0,1)r \in (0, 1).

Why this matters. "Full diversity" is a point property: it says "at this fixed rate, the code achieves the best reliability". "DMT- optimal" is a curve property: "at every rate in [0,rmax][0, r_{\max}], the code achieves the best reliability". A code can be full-diversity without being DMT-optimal — that is Alamouti's fate. Chapter 13's Golden / CDA codes are both full-diversity at r=0r = 0 and DMT- optimal at every rr: they extend the Alamouti property to the full curve via algebraic constructions.

,

Quick Check

On a 4×44 \times 4 channel with V-BLAST-ZF at r=1r = 1 multiplexing, the achieved diversity is dZF(1)=?d_{\rm ZF}(1) = ? and the DMT bound is d(1)=?d^*(1) = ?.

dZF(1)=9d_{\rm ZF}(1) = 9, d(1)=9d^*(1) = 9

dZF(1)=3/4d_{\rm ZF}(1) = 3/4, d(1)=9d^*(1) = 9

dZF(1)=1d_{\rm ZF}(1) = 1, d(1)=9d^*(1) = 9

dZF(1)=0d_{\rm ZF}(1) = 0, d(1)=0d^*(1) = 0

Preview: The Golden Code and CDA Constructions

The Golden code (Belfiore-Rekaya-Viterbo 2005) is a 2×22 \times 2 space-time code constructed from the extension Q(i,5)/Q(i)\mathbb{Q}(i, \sqrt{5})/\mathbb{Q}(i) — the smallest cyclic division algebra (CDA) over the Gaussian integers. Its codeword matrix has nonzero determinant for every nonzero error matrix, and moreover the minimum determinant scales like SNRr\text{SNR}^{-r} at every r[0,2]r \in [0, 2] — the "nonvanishing determinant" property. Combined with the rank criterion, this achieves the DMT curve (0,4),(1,1),(2,0)(0, 4), (1, 1), (2, 0) exactly, for every rate, in a single coding scheme without time-sharing.

Chapter 13 generalises this construction to arbitrary nt×ntn_t \times n_t CDA codes (the Elia-Kumar-Pawar-Kumar-Lu / Oggier-Rekaya-Belfiore- Viterbo "Perfect" codes), and Chapter 17 extends further to LAST (lattice space-time) codes that work for any nt×nrn_t \times n_r including the asymmetric case.

The pattern is: DMT optimality requires algebraic structure. Random Gaussian codebooks achieve the DMT in Zheng-Tse's proof, but in practice one wants deterministic codes with short blocklengths — and those are built from number fields, cyclic algebras, and lattices. This is the central message of Chapters 13, 15, and 17.

,

Why This Matters: From Existence to Construction: Chapter 13's CDA Codes

The Zheng-Tse theorem is an existence result: it proves that a random Gaussian codebook achieves the DMT curve, but gives no explicit construction. Chapter 13 — jointly credited to Elia-Kumar-Pawar-Kumar- Lu and Oggier-Rekaya-Belfiore-Viterbo — provides explicit algebraic constructions that achieve the same DMT with moderate block length, closed-form encoding, and bounded-complexity decoding (sphere decoder or lattice decoder).

The CommIT group contribution to Chapter 13 is the Elia et al. 2006 IEEE Trans. IT paper, which proved that cyclic division algebras over number fields give DMT-optimal codes for arbitrary ntn_t. Petros Elia (Caire's student, now at EURECOM) unified the Golden code (Belfiore-Rekaya-Viterbo 2005) and the Perfect codes under a single algebraic framework. Together with the 2004 El Gamal-Caire-Damen LAST paper (Chapter 17), this delivers the modern DMT-optimal code family.

DMT-Optimal Code

A family of space-time codes that achieves the Zheng-Tse DMT curve d(r)d^*(r) for every r[0,rmax]r \in [0, r_{\max}]. Most classical codes (Alamouti, V-BLAST) are not DMT-optimal; the CDA / Golden / Perfect / LAST constructions of Chapters 13, 17 are. DMT optimality is a curve property, distinct from full-diversity optimality at a single rate.

Related: Diversity-Multiplexing Tradeoff Curve d(r)d^*(r), Golden Code, Preview: The Golden Code and CDA Constructions, Last Codes

Golden Code

A 2×22 \times 2 space-time code constructed from the cyclic division algebra Q(i,5)/Q(i)\mathbb{Q}(i, \sqrt{5}) / \mathbb{Q}(i) (Belfiore-Rekaya- Viterbo 2005). Achieves the full Zheng-Tse DMT curve on 2×22 \times 2 i.i.d. Rayleigh and has good coding gain. The prototypical DMT-optimal code; detailed in Chapter 13.

Related: DMT-Optimal Code, Preview: The Golden Code and CDA Constructions, Perfect Codes, Dispersion Matrix Expansion of a Linear STBC