Code Operating Points on the DMT
Classifying Space-Time Codes by Their DMT Operating Point
Every space-time code has a natural DMT operating trace: operate it at rate and compute its achieved diversity gain . The result is a function that lies on or below the DMT curve . A code is DMT-optimal if for all .
In this section we classify the main space-time codes of Chapter 11 by their DMT operating traces:
- Alamouti sits at a single corner on an channel — full diversity, but rate fixed at bit/use so it cannot be operated at any with diversity.
- V-BLAST with zero-forcing on an channel sits at the opposite corner — full multiplexing, low diversity per stream.
- V-BLAST with ML detection lifts the ZF diversity to but still does not reach for intermediate .
- The Golden code (and more generally the CDA / Perfect codes of Chapter 13) is DMT-optimal on : it achieves for every .
- D-BLAST with an outer code is DMT-optimal for arbitrary , 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
DMT-Optimal Code
A family of space-time codes with per- symbol rate is DMT-optimal if its achieved diversity gain equals the Zheng-Tse exponent: with the piecewise-linear interpolation achieved by time-sharing. A code is DMT-optimal at a single rate if it achieves at that specific but not elsewhere.
The distinction matters because most classical codes are single-point optimal: Alamouti is DMT-optimal at only, V-BLAST-ML is DMT- optimal at 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
The Alamouti scheme transmits complex symbols over a space-time codeword matrix, achieving rate bits per channel use for -QAM. Its DMT operating trace is Beyond the Alamouti rate cannot grow with SNR (the constellation is bounded) so for .
At (fixed rate) Alamouti achieves the full diversity — it is DMT-optimal at . But for any , , 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 diversity structure (rank- codeword difference matrix ). At this is optimal — you cannot buy more diversity. At 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 , a QAM constellation with points has outage probability .
Alamouti on reduces to a single scalar Rayleigh channel with effective SNR .
The effective scalar channel gain follows chi-square with complex degrees of freedom outage exponent by the scalar DMT argument (Example )" data-ref-type="example">EDMT of the Scalar Rayleigh Channel ()).
Compare with from Zheng-Tse.
Alamouti reduces to scalar channel
The Alamouti scheme on transforms the MIMO channel into parallel scalar Rayleigh channels with equal gain: after Alamouti decoding, each transmitted symbol sees effective SNR , where the sum is over i.i.d. variables. The sum-of-squared- magnitudes is chi-square with complex degrees of freedom.
DMT of a chi-square-distributed scalar channel
Let with . Then has Gamma density with shape : At rate , the outage event is , i.e., . The CDF at small argument is , so .
Comparison with DMT
On (): ; is the piecewise-linear interpolation of . At : both (Alamouti optimal). At : Alamouti but (Alamouti sub-optimal — at this rate it has zero reliability, not one). At : Alamouti , (Alamouti below curve).
Conclusion. Alamouti is DMT-optimal only at . For any it is strictly sub-optimal: the Alamouti line is a chord of the DMT curve from to , which is below the piecewise linear curve through . The gap is the structural "rate cost" of one-stream transmission.
Theorem: DMT of V-BLAST: ZF, MMSE, and ML
Consider V-BLAST on an i.i.d. Rayleigh channel with , transmitting independent -QAM streams, one per transmit antenna. Its DMT operating trace depends on the receiver:
(i) V-BLAST with zero-forcing (ZF): At , (outage-limited). The max diversity is .
(ii) V-BLAST with ML detection: At , ; max diversity .
Both traces are straight lines from to — chord approximations to the DMT curve. V-BLAST-ML achieves the DMT corner at but falls below the DMT curve at all interior . 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 sees only spatial degrees of freedom (the remaining are used to null the interference). This is the diversity of the post-ZF scalar channel.
ML jointly detects all streams, restoring the full receive- diversity 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.
ZF: each stream sees an effective scalar channel with gain equal to the smallest diagonal of .
ML: each stream still sees the full channel — the outage event is now governed by the worst eigenvalue of .
Both V-BLAST traces are chords of the DMT, not the piecewise-linear curve itself.
ZF per-stream SINR
After zero-forcing, the -th stream sees effective SNR . The diagonal of is chi-square distributed with complex degrees of freedom, so each stream sees a scalar Rayleigh channel with diversity .
ZF DMT trace
At stream rate , the per-stream scalar DMT argument gives stream outage exponent . With independent streams (no coding across them), the block outage event is dominated by any one stream's outage — but the exponent is still (the independent streams are a union-bound prefactor, invisible to ).
ML per-stream SINR
ML detection does not project onto the null space; it jointly optimises over all streams. Each stream sees the full channel matrix, with effective diversity equal to the minimum of the eigenvalues of (limiting factor in a joint-detection outage event at stream rate ).
ML DMT trace
The minimum eigenvalue of is chi-square with degrees of freedom (generalized chi-square tail behaviour). But the ML joint outage region is larger than the ZF per-stream region, and a careful Wishart computation gives At : (= receive diversity of a single stream with the full receive array). At : — V-BLAST-ML does touch the DMT right endpoint, which is why V-BLAST "achieves the multiplexing gain" in the Foschini sense.
Comparison with DMT
On : , , piecewise-linear.
- At : , , — ML gets receive diversity but misses transmit diversity; both miss the full DMT.
- At : , , — all three codes touch here.
- At : , , — V-BLAST-ML does touch at this specific midpoint by coincidence (a numerical coincidence in , not a general pattern).
Space-Time Codes on the DMT Curve
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 . For each configuration the plot shows:
- Solid line — the full DMT curve (Zheng-Tse bound).
- Dot and chord — Alamouti at and its zero-rate chord.
- Dashed line — V-BLAST ZF trace .
- Dot-dashed line — V-BLAST ML trace .
- Golden code — achieves the full curve on (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
Example: V-BLAST-ML at on
Compute the V-BLAST-ML diversity at multiplexing gain on a MIMO channel, and compare with the Zheng-Tse optimum . How big is the gap?
V-BLAST-ML trace
From Thm. TDMT of V-BLAST: ZF, MMSE, and ML, . At : .
Zheng-Tse bound
From Thm. TZheng-Tse Diversity-Multiplexing Tradeoff, at the integer corner . The DMT curve passes through .
Gap
V-BLAST-ML achieves ; the optimum is . The gap is , which translates at high SNR into a BER advantage of the DMT-optimal code by — i.e., 6 dB per decade of BER improvement.
Operational reading. Even with optimal ML detection, V-BLAST is losing half the diversity at intermediate . The missing diversity is the "coding across antennas" that V-BLAST does not do. Adding an outer code across antennas (D-BLAST, Foschini 1996) recovers DMT optimality at the cost of a diagonal layering structure; the Golden code / CDA constructions of Chapter 13 recover DMT optimality in a single layer via algebraic structure.
Space-Time Codes on the DMT Curve
| Code | Channel | Rate | Mux gain | Div achieved | DMT opt? | Section |
|---|---|---|---|---|---|---|
| Alamouti | fixed 1 bit/use | = | at only | Ch. 11 | ||
| V-BLAST ZF | , | at | no | Ch. 11 | ||
| V-BLAST ML | , | at only (chord touches corner) | Ch. 11 | |||
| Golden code (2×2) | any | YES | Ch. 13 | |||
| Perfect codes (general) | any | YES | Ch. 13 | |||
| D-BLAST + outer code | any | YES (impractical) | Ch. 11, 13 | |||
| LAST codes | any | YES (lattice) | Ch. 17 |
Common Mistake: Alamouti Is Full-Diversity, Not DMT-Optimal
Mistake:
Concluding that because Alamouti achieves full diversity , it must be DMT-optimal (or at least "optimal" in any meaningful sense) on a channel.
Correction:
Alamouti achieves full diversity at rate only. At 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 to that dips below the DMT curve for any .
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 , 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 and DMT- optimal at every : they extend the Alamouti property to the full curve via algebraic constructions.
Quick Check
On a channel with V-BLAST-ZF at multiplexing, the achieved diversity is and the DMT bound is .
,
,
,
,
. . The gap is more than an order of magnitude in the SNR exponent. V-BLAST-ZF is dramatically sub- optimal away from the corner.
Preview: The Golden Code and CDA Constructions
The Golden code (Belfiore-Rekaya-Viterbo 2005) is a space-time code constructed from the extension — 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 at every — the "nonvanishing determinant" property. Combined with the rank criterion, this achieves the DMT curve exactly, for every rate, in a single coding scheme without time-sharing.
Chapter 13 generalises this construction to arbitrary 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 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 . 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 for every . 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 , Golden Code, Preview: The Golden Code and CDA Constructions, Last Codes
Golden Code
A space-time code constructed from the cyclic division algebra (Belfiore-Rekaya- Viterbo 2005). Achieves the full Zheng-Tse DMT curve on 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