References & Further Reading

References

P. Elia, K. R. Kumar, S. A. Pawar, P. V. Kumar, H.-f. Lu, and G. Caire, Explicit space-time codes achieving the diversity-multiplexing gain tradeoff, 2006
THE central paper of this chapter, and the CommIT contribution spotlighted in §2. Establishes that cyclic division algebra (CDA) codes with the non-vanishing- determinant (NVD) property achieve the full Zheng-Tse DMT curve for every $(n_t, n_r)$ and are approximately universal over every fading distribution in $\mathcal{F}_{\rm adm}$. Closes the DMT-optimal-construction problem for linear space-time block codes. Six-author paper: P. Elia, K. R. Kumar, S. A. Pawar, and P. V. Kumar at USC; H.-f. Lu at National Chiao Tung; Giuseppe Caire at USC (now TU Berlin).
J.-C. Belfiore, G. Rekaya, and E. Viterbo, The Golden Code: A 2×2 full-rate space-time code with nonvanishing determinants, 2005
The Golden code paper. Constructs the first explicit $2 \times 2$ DMT-optimal space-time code over the cyclic division algebra $\mathbb{Q}(j, \theta)/\mathbb{Q}(j)$ with $\theta = (1 + \sqrt{5})/2$. The NVD property (coding gain $\delta_{\min} = 1/5$) is the algebraic fingerprint of DMT optimality. Foundational reference for §1 of this chapter.
F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, Perfect space-time block codes, 2006
The Perfect-codes paper, companion to Elia et al. 2006 (same IEEE Trans. IT issue). Defines the Perfect-code properties (full rate, full diversity + NVD, uniform average energy, cubic shaping) and proves that Perfect codes exist only in $n_t \in \{2, 3, 4, 6\}$. Awarded the IEEE Information Theory Society Paper Award in 2008. Foundational reference for §3.
S. Tavildar and P. Viswanath, Approximately universal codes over slow-fading channels, 2006
Introduced the concept of **approximate universality** and proved it for CDA-NVD codes over the admissible fading class. The paper predates Elia et al. 2006 by a few months; the two papers together established the approximate-universality framework. Foundational reference for §4.
L. Zheng and D. N. C. Tse, Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels, 2003
The Zheng-Tse DMT paper. Backward reference to Ch. 12. This chapter takes Zheng-Tse's existence result and turns it into explicit constructions via CDAs. The Zheng-Tse converse provides the DMT upper bound; Elia-Kumar-Caire 2006 and the Perfect-codes family provide the matching achievability.
V. Tarokh, N. Seshadri, and A. R. Calderbank, Space-time codes for high data rate wireless communication: performance criterion and code construction, 1998
Introduced the rank and determinant criteria for space-time code design. The NVD property (non-vanishing determinant) of this chapter is the generalisation of the determinant criterion to the setting of constellation-scaling families of codes, where the determinant must stay bounded away from zero as $M \to \infty$.
S. M. Alamouti, A simple transmit diversity technique for wireless communications, 1998
The Alamouti scheme. Backward reference to Ch. 11. Serves as the baseline against which CDA codes are compared: Alamouti achieves full diversity at rate 1 and $r = 0$, but saturates. CDA codes match Alamouti at $r = 0$ and extend the DMT curve to all $r > 0$.
B. Hassibi and B. M. Hochwald, High-rate codes that are linear in space and time, 2002
Linear dispersion codes (LDCs). Backward reference to Ch. 11. LDCs are a broader linear-code family that includes CDA codes as a special case; LDC design via mutual-information maximisation does not automatically give NVD. The CDA-NVD framework of this chapter can be viewed as a "structured LDC" that prioritises DMT optimality over mutual-information maximisation.
D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, 2005
The standard wireless-communications textbook. §9.5 presents the Golden code and the CDA framework accessibly; §9.6 discusses approximate universality. Pedagogically complementary to this chapter; the derivations are sometimes less formal but the intuition-building is excellent.
H. El Gamal, G. Caire, and M. O. Damen, Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels, 2004
Forward reference to Ch. 17 (LAST codes). Proves that lattice space-time codes with MMSE-GDFE receivers achieve the Zheng-Tse DMT for arbitrary $(n_t, n_r)$. Complementary to the CDA framework — LAST codes give a different construction strategy that extends naturally to asymmetric channels and to the ARQ-DMT of Ch. 14. Foundational CommIT contribution cited in §5's wireless-connection block.
E. Biglieri, Coding for Wireless Channels, Springer, 2005
Comprehensive textbook on coded modulation for wireless. Chapters 7–8 cover space-time coding with an algebraic flavour, including an early preview of CDA codes and the Perfect-codes family. Complementary to Tse-Viswanath-2005 for readers who prefer a coding-theory-oriented presentation.
B. A. Sethuraman, B. S. Rajan, and V. Shashidhar, Full-diversity, high-rate space-time block codes from division algebras, 2003
The precursor paper that introduced the use of cyclic division algebras for full-diversity space-time codes. Proves that CDAs give full diversity but not DMT optimality at high $r$ — the step that Belfiore-Rekaya-Viterbo (2005) for $n_t = 2$ and Elia-Kumar-Caire (2006) for arbitrary $n_t$ later completed via the NVD condition. Foundational reference for §2's CDA construction.
E. Viterbo and J. Boutros, A universal lattice code decoder for fading channels, 1999
The original **sphere decoder** paper for lattice codes on fading channels. Reduces the ML decoding complexity of lattice-based space-time codes (including CDA codes) from $O(M^{n_t^2})$ to $O(M^{n_t^2/2})$ on average. Essential for practical CDA code deployment; cited in §2's engineering note on sphere-decoder complexity.
M. O. Damen, A. Chkeif, and J.-C. Belfiore, Lattice code decoder for space-time codes, 2000
Refinement of the Viterbo-Boutros sphere decoder specialised to space-time codes with algebraic structure. Further reduces average complexity via tree-pruning heuristics tuned to the CDA codeword geometry. Cited alongside Viterbo-Boutros in §2's engineering note.
M. O. Damen, A. Tewfik, and J.-C. Belfiore, A construction of a space-time code based on number theory, 2002
Introduced **threaded algebraic space-time codes** — a full-diversity CDA-like construction from number fields. These codes have a coding gain $\delta_{\min} \propto 1/\sqrt{M}$ that decays with constellation size, i.e., they are NOT NVD and lose DMT optimality at high $r$. Historical precursor whose shortcomings motivated the Belfiore-Rekaya-Viterbo 2005 Golden-code construction.
B. Hassibi and H. Vikalo, On the sphere-decoding algorithm I. Expected complexity, 2005
Rigorous analysis of the sphere decoder's expected complexity. Shows that the average complexity is polynomial in $M$ at moderate SNR (approximately $M^{n_t^2 / 2}$) and exponential only in the tail. Provides the theoretical justification for the "practical sphere decoder" complexity estimate used in §2's engineering note.
3GPP, NR; Physical channels and modulation, 2022. [Link]
5G NR physical-layer specification. Defines the codebook- based MIMO precoding (Type-I and Type-II) that 5G NR uses in place of full CDA codes. Cited in §5's engineering note on practical systems.
ETSI, Digital Video Broadcasting (DVB); Next-Generation Handheld (DVB-NGH) physical layer specification, 2012. [Link]
The DVB-NGH mobile-TV standard. Adopted (in its scaled integer form) the **Golden code** as the optional 2×2 MIMO mode for high-mobility broadcast. The rare standard that implements a CDA code in practice.