Chapter Summary

Chapter Summary

Key Points

• 1.

  Alamouti's code is the simplest non-trivial STBC and achieves full diversity $2 n_r$ with linear decoding. The orthogonality identity $\mathbf{X}_A\mathbf{X}_A^H = (|s_1|^2 + |s_2|^2)\mathbf{I}_2$ folds the $2\times 2$ MIMO channel into a virtual channel with orthogonal columns; the matched filter then decouples the decision into two scalar slicers (Thm. $2 n_r$ with Linear Decoding" data-ref-type="theorem">TAlamouti Achieves Full Diversity $2 n_r$ with Linear Decoding). The diversity is the same as a $1\times 2 n_r$ MRC receiver; the $3$ dB penalty comes from splitting the transmit energy across two antennas with no CSIT.

• 2.

  OSTBCs generalise Alamouti via the Hurwitz-Radon-Eckmann algebra. The Tarokh-Jafarkhani-Calderbank 1999 construction: dispersion matrices $\{\mathbf{A}_q, \mathbf{B}_q\}$ satisfying anti-commutation relations produce a codeword with $\mathbf{X}\mathbf{X}^H = \|\mathbf{s}\|^2 \mathbf{I}_{n_t}$ and full diversity $n_t n_r$ with scalar-decoupled ML decoding (Thm. $n_t n_r$" data-ref-type="theorem">TEvery OSTBC Achieves Full Diversity $n_t n_r$).

• 3.

  The Liang-Tarokh bound caps complex-OSTBC rate at $R_{\max} = (\lfloor n_t/2\rfloor + 1)/(2\lfloor n_t/2\rfloor)$. Specifically $R_{\max}(n_t = 2) = 1, R_{\max}(n_t \in \{3,4\}) = 3/4, R_{\max}(n_t \in \{5,6\}) = 2/3$ (Thm. TLiang-Tarokh Rate Upper Bound for Complex OSTBCs). Rate 1 is available only for $n_t = 2$ — this is the fundamental limit of orthogonal complex STBCs. The Hurwitz-Radon-Eckmann algebra of the $\mathbb{R}, \mathbb{C}, \mathbb{H}, \mathbb{O}$ real division algebras is the deep algebraic reason.

• 4.

  Quasi-orthogonal STBCs recover rate 1 at $n_t = 4$ by giving up diversity. Jafarkhani's 2001 QOSTBC uses Alamouti blocks arranged Alamouti-style: rate 1, diversity $2 n_r$ (half the full), and a pair-wise ML decoder of complexity $O(M^2)$ (Thm. $2 n_r$, Pair-Wise ML Decoder" data-ref-type="theorem">TJafarkhani QOSTBC: Rate 1, Diversity $2 n_r$, Pair-Wise ML Decoder). Sharma-Papadias 2003 showed that constellation rotation restores full diversity at the same rate. The QOSTBC is the clearest illustration of the rate-diversity- complexity triangle in space-time coding.

• 5.

  Linear dispersion codes (LDCs) are the most general linear STC framework. Hassibi-Hochwald 2002: $\mathbf{X} = \sum_q (\alpha_q \mathbf{A}_q + j\beta_q \mathbf{B}_q)$ for arbitrary dispersion matrices. Every linear STBC — Alamouti, OSTBC, QOSTBC, V-BLAST — is an LDC with specific dispersion matrices. LDC design is a convex optimisation over the Gramian $\sum_q (\mathbf{A}_q^H\mathbf{A}_q + \mathbf{B}_q^H\mathbf{B}_q)$ and can be solved by semidefinite programming.

• 6.

  LDCs can achieve the MIMO ergodic capacity. As $Q \to 2 n_t n_r T$, a suitably designed LDC approaches the Shannon capacity of the i.i.d. Rayleigh MIMO channel (Thm. TLDCs Achieve the MIMO Ergodic Capacity). The decoder is no longer scalar — it is a lattice / sphere decoder with complexity $O(M^{K/2})$ at moderate SNR. This is the bridge from "structured linear codes" (Alamouti, OSTBC) to "capacity-achieving linear codes" (LDCs) and then to "DMT-optimal codes" (Ch. 13's cyclic-division-algebra constructions).

• 7.

  Rate, diversity, and decoder complexity form a trade-off triangle. Alamouti gives (rate 1, full diversity, linear decoder) — but only for $n_t = 2$. OSTBC gives (rate $\le 3/4$, full diversity, linear decoder) for $n_t > 2$. QOSTBC gives (rate 1, half diversity, pair- wise decoder) for $n_t = 4$. V-BLAST gives (rate $n_t$, minimal diversity, SIC decoder). LDC gives (any rate, any diversity, lattice decoder) by design. You can have any two corners of the triangle, not all three — the Zheng-Tse DMT of Ch. 12 makes this precise.

• 8.

  In standards, Alamouti is the dominant STBC. 3GPP WCDMA (2000), LTE TM2 (2008), and 5G NR fallback modes (2018) all use Alamouti at $n_t = 2$. OSTBC, QOSTBC, and LDCs have not entered mainstream cellular / Wi-Fi standards — closed-loop codebook precoding + LDPC

  • spatial multiplexing dominates for $n_t > 2$. This is the practical coda to this chapter: Alamouti is the enduring success; the more sophisticated constructions remain research benchmarks and pedagogical touchstones.