Prerequisites & Notation

Before You Begin

This chapter turns the Zheng-Tse existence theorem of Chapter 12 into explicit constructions of space-time codes that achieve the entire diversity-multiplexing tradeoff curve — and, beyond that, achieve it for every reasonable fading distribution. The machinery is algebraic (cyclic division algebras over number fields) rather than purely information-theoretic. To follow the constructions and proofs the reader needs the rank and determinant criteria (Chapter 11) for pairwise error probability, the DMT curve $d^*(r)$ and the exponential-equality $\doteq$ notation (Chapter 12), and basic familiarity with quadratic number fields, Galois automorphisms, and the algebraic norm. No prior exposure to division algebras is assumed — §2 builds the CDA framework from scratch — but a reader comfortable with the idea of an extension $\mathbb{Q}(\sqrt{5})/ \mathbb{Q}$ and with the ring-theoretic notion of "every non-zero element is invertible" will travel fastest.

Pairwise error probability and the rank/determinant criteria(Review ch11)
Self-check: Can you state the high-SNR PEP bound $P(\ntn{X} \to \hat{\ntn{X}}) \le \prod_{i=1}^r (1 + \tfrac{\text{SNR}}{4 n_t} \lambda_i( \boldsymbol{\Delta}\boldsymbol{\Delta}^H))^{-n_r}$ and identify the rank-criterion role ( $\mathrm{rank}(\boldsymbol{\Delta}) = n_t \Rightarrow$ full diversity $n_t n_r$ ) and the determinant-criterion role ( $\det(\boldsymbol{\Delta}\boldsymbol{\Delta}^H)$ controls coding gain)?
Zheng-Tse DMT curve $d^*(r) = (n_t - r)(n_r - r)$ and exponential equality $\doteq$ (Review ch12)
Self-check: Can you state the Zheng-Tse tradeoff for an $n_t \times n_r$ i.i.d. Rayleigh channel and identify the corner points $(k, (n_t - k)(n_r - k))$ for $k = 0, 1, \ldots, \min(n_t, n_r)$ ? And fluently manipulate $\doteq$ ?
Outage-code operating points on the DMT(Review ch12)
Self-check: Can you explain why uncoded V-BLAST-ML achieves $r = \min(n_t, n_r)$ but only $d = n_r$ (sub-optimal for $r < n_t$ ), and why Alamouti achieves $d = 2 n_r$ at $r = 0$ but its rate saturates at $r = 1$ ?
Galois theory of quadratic extensions
Self-check: Can you state that $\mathbb{Q}(\sqrt{5})/\mathbb{Q}$ is a degree-2 Galois extension with generator $\sigma: \sqrt{5} \mapsto -\sqrt{5}$ , and compute the algebraic norm $N(a + b\sqrt{5}) = (a + b\sqrt{5}) (a - b\sqrt{5}) = a^2 - 5 b^2$ ?
Basic ring theory: division rings and ideals
Self-check: Can you state that a division ring is a ring in which every non-zero element has a multiplicative inverse, and recall that $\mathbb{H}$ (Hamilton's quaternions) is the standard example of a non-commutative division ring?
Number fields and their rings of integers
Self-check: Can you name the ring of integers of $\mathbb{Q}(j)$ as the Gaussian integers $\mathbb{Z}[j]$ and explain why every standard M-QAM constellation point lies in a scaled translate of $\mathbb{Z}[j]$ ?

Notation for This Chapter

Symbols specific to the algebraic-code-construction analysis. The Chapter 10–12 MIMO notation (channel matrix $\mathbf{H}$ , codeword matrix $\ntn{X}$ , SNR $\text{SNR}$ , DMT curve $d^*(r)$ , codeword difference $\boldsymbol{\Delta}$ ) continues to apply and is not repeated here.

Symbol	Meaning	Introduced
$\theta$	The golden ratio $\theta = (1 + \sqrt{5})/2$ ; its Galois conjugate is $\bar\theta = 1 - \theta = (1 - \sqrt{5})/2$	s01
$\alpha$	The Golden-code unit $\alpha = 1 + j\bar\theta$ ; its conjugate $\bar\alpha = 1 + j\theta$ (used to ensure orthogonality and uniform average energy)	s01
$\delta_{\min}$	Minimum codeword-pair determinant $\min_{\ntn{X} \neq \hat{\ntn{X}}} \|\det(\boldsymbol{\Delta}\boldsymbol{\Delta}^H)\|$ ; the coding-gain proxy	s01
$\mathcal{A}(F, K, \sigma, \gamma)$	Cyclic algebra: degree- $n$ cyclic extension $K/F$ with Galois generator $\sigma$ and non-norm element $\gamma \in F$	s02
$F, K$	Base field $F$ (here $\mathbb{Q}(j)$ ) and cyclic extension $K$ of degree $n_t$ over $F$	s02
$\sigma$	Generator of the Galois group $\mathrm{Gal}(K/F)$ ; the Galois automorphism on $K$	s02
$\gamma$	Non-norm element in $F^$ : $\gamma \notin N_{K/F}(K^)$ , which makes $\mathcal{A}$ a division algebra	s02
$n_t$	Number of transmit antennas; also the degree of the cyclic extension $K/F$ in the CDA construction	s02
$N_{K/F}(\cdot)$	Algebraic norm of $K$ over $F$ : $N_{K/F}(x) = \prod_{i=0}^{n_t - 1} \sigma^i(x)$	s02
$NVD$	Non-Vanishing-Determinant property: $\delta_{\min}$ is bounded below by a positive constant that does not depend on the input constellation size $M$	s05
$M$	Input QAM constellation size (e.g., $M = 4, 16, 64, \ldots$ ); the information symbols take values in a finite subset of $\mathbb{Z}[j]$	s01
$d_{\mathrm{au}}(r)$	Approximately-universal diversity-multiplexing exponent: largest $d$ achievable over every fading distribution satisfying the Tavildar-Viswanath regularity conditions	s04

← Ch 12 The Golden Code for

2 \times 2

MIMO