References & Further Reading

References

  1. S. M. Alamouti, A simple transmit diversity technique for wireless communications, 1998

    The landmark paper that introduced the $2\times 2$ orthogonal codeword matrix $\mathbf{X}_A$. Only 8 pages, more than 25,000 citations — among the most cited papers in wireless communications. Establishes rate 1, full diversity $2 n_r$, linear matched-filter decoding at a 3 dB transmit-power-splitting cost. Required reading for §1 of this chapter and the historical anchor of the whole STBC story.

  2. V. Tarokh, H. Jafarkhani, and A. R. Calderbank, Space-time block codes from orthogonal designs, 1999

    Generalises Alamouti to $n_t > 2$ via the Hurwitz-Radon-Eckmann algebra. Constructs rate-$1/2$ and rate-$3/4$ complex OSTBCs for $n_t = 3, 4, 8$ and shows they achieve full diversity with linear decoding. The foundational OSTBC paper; the rate-$3/4$ construction of Ex. <a href="#ex-ostbc-rate-3-4" class="ferkans-ref" title="Example: Rate-$3/4$ OSTBC for $n_t = 4$: Tarokh-Jafarkhani-Calderbank 1999" data-ref-type="example"><span class="ferkans-ref-badge">E</span>Rate-$3/4$ OSTBC for $n_t = 4$: Tarokh-Jafarkhani-Calderbank 1999</a> comes from this reference.

  3. V. Tarokh, N. Seshadri, and A. R. Calderbank, Space-time codes for high data rate wireless communication: Performance criterion and code construction, 1998

    The earlier (March 1998) companion to Alamouti, establishing the rank and determinant criteria for space-time codes and constructing several trellis STCs for $n_t = 2, 4$. Required reading for Ch. 10; cited here for the diversity-order / rank-criterion machinery used throughout this chapter.

  4. H. Jafarkhani, A quasi-orthogonal space-time block code, 2001

    Introduces the QOSTBC for $n_t = 4$: Alamouti blocks arranged in an Alamouti-of-Alamouti structure, giving rate 1 at the cost of half the full diversity and a pair-wise ML decoder. The clearest illustration in the literature of the rate-diversity-complexity trade in space-time coding. Required reading for §4.

  5. X.-B. Liang, Orthogonal designs with maximal rates, 2003

    Establishes the tight upper bound $R_{\max}(n_t) = (\lfloor n_t/2 \rfloor + 1)/(2\lfloor n_t/2\rfloor)$ for complex OSTBCs and constructs designs achieving it for every $n_t$. Extends the 1999 TJC paper's constructive results to all $n_t$ and closes the rate question for complex OSTBCs. Required reading for §3.

  6. B. Hassibi and B. M. Hochwald, High-rate codes that are linear in space and time, 2002

    The LDC framework: most general linear STC representation via dispersion matrices, convex design via SDP, capacity-achieving universality as $Q \to 2 n_t n_r T$. The unifying paper for linear space-time coding; every paper after 2002 uses its vocabulary. Required reading for §5.

  7. P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel, 1998

    Introduces V-BLAST: $n_t$ independent data streams with SIC receiver, achieving full multiplexing but minimal diversity. The opposite- extreme counterpoint to Alamouti in the rate-diversity plane. Historical anchor for §3 (V-BLAST comparison) and §5 (LDC generality).

  8. N. Sharma and C. B. Papadias, Improved quasi-orthogonal codes through constellation rotation, 2003

    Shows that pre-rotating half the QOSTBC symbols by an irrational angle restores full diversity $n_t n_r$ at the same rate 1. The "rotated QOSTBC" or "optimal QOSTBC" variant; production-grade improvement over Jafarkhani 2001. Mentioned in §4 pitfall.

  9. O. Tirkkonen and A. Hottinen, Square-matrix embeddable space-time block codes for complex signal constellations, 2002

    Parallel development of the OSTBC rate bound for complex constellations; identifies the Hurwitz-Radon-Eckmann structure explicitly and derives the same $R_{\max}$ formula as Liang 2003. Complementary reading to Liang 2003; together they settle the OSTBC rate question.

  10. D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, 2005

    Standard graduate-level textbook. §3.3.2 is the canonical textbook exposition of Alamouti; §9.2 discusses the rate-diversity trade-off and introduces the Zheng-Tse DMT. Chapter 10 (space-time coding) covers OSTBCs and briefly LDCs. The reference for this book's Chapters 10–12.

  11. A. Paulraj, R. Nabar, and D. Gore, Introduction to Space-Time Wireless Communications, Cambridge University Press, 2003

    The first textbook dedicated to space-time wireless. §6 covers Alamouti, OSTBC, QOSTBC, and LDCs with detailed derivations and worked examples. The $3/4$ OSTBC construction of Ex. <a href="#ex-ostbc-rate-3-4" class="ferkans-ref" title="Example: Rate-$3/4$ OSTBC for $n_t = 4$: Tarokh-Jafarkhani-Calderbank 1999" data-ref-type="example"><span class="ferkans-ref-badge">E</span>Rate-$3/4$ OSTBC for $n_t = 4$: Tarokh-Jafarkhani-Calderbank 1999</a> is presented concretely in §6.5.

  12. E. Biglieri, Coding for Wireless Channels, Springer, 2005

    Comprehensive textbook on coding for wireless by a leading authority. The space-time-coding chapter covers OSTBCs, QOSTBCs, and LDCs with emphasis on the algebraic structure (Hurwitz-Radon-Eckmann, representation theory of Clifford algebras) that underlies the rate bounds. Complementary reading for §2, §3.

  13. J. G. Proakis and M. Salehi, Digital Communications, McGraw-Hill, 5th ed., 2008

    Standard undergraduate-to-graduate reference. §15.4 covers Alamouti and OSTBCs with BER analysis for QPSK and QAM. The BER formula machinery of Ex. <a href="#ex-alamouti-qpsk" class="ferkans-ref" title="Example: Alamouti with QPSK: Two Scalar QPSK Decisions" data-ref-type="example"><span class="ferkans-ref-badge">E</span>Alamouti with QPSK: Two Scalar QPSK Decisions</a> follows this reference.

  14. 3GPP, LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation, 2022. [Link]

    LTE physical-layer specification. §6.3 (Transmission modes) covers Alamouti-based transmit diversity (TM2) and block-Alamouti for 4-Tx (TM3). Cited in engineering notes of §1 and §4.

  15. 3GPP, NR; Physical channels and modulation, 2022. [Link]

    5G NR physical-layer specification. Defines the Type-I / Type-II codebook precoding that supersedes open-loop STBC in 5G data channels. Alamouti-style transmit diversity is retained in some broadcast / control-channel modes. Cited in §1 engineering note.

  16. İ. E. Telatar, Capacity of multi-antenna Gaussian channels, 1999

    The foundational paper on MIMO capacity, establishing that i.i.d. complex Gaussian input achieves the ergodic capacity $\mathbb{E}[\log\det(\mathbf{I} + (\ntn{snr}/n_t)\ntn{ch}\ntn{ch}^H)]$. Cited in the LDC capacity theorem (Thm. <a href="#thm-ldc-capacity" class="ferkans-ref" title="Theorem: LDCs Achieve the MIMO Ergodic Capacity" data-ref-type="theorem"><span class="ferkans-ref-badge">T</span>LDCs Achieve the MIMO Ergodic Capacity</a>).

Further Reading

For readers interested in deeper or related aspects of space-time block codes, quasi-orthogonal constructions, and linear dispersion design.

  • DMT-optimal codes and cyclic division algebras

    J.-C. Belfiore, G. Rekaya, and E. Viterbo, "The Golden code: a $2 \times 2$ full-rate space-time code with non-vanishing determinants," IEEE Trans. Inform. Theory, vol. 51, no. 4, pp. 1432-1436, Apr. 2005.

    The Golden code is a rate-2 full-diversity DMT-optimal code for $n_t = 2, n_r \ge 2$. Non-linear in the symbols but algebraically structured via cyclotomic extensions. Chapter 13 of this book develops the CDA framework that subsumes Golden / Perfect / LAST codes.

  • Perfect space-time codes for general $n_t$

    F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, "Perfect space-time block codes," IEEE Trans. Inform. Theory, vol. 52, no. 9, pp. 3885-3902, Sep. 2006.

    Constructs DMT-optimal codes for $n_t = 2, 3, 4, 6$ via cyclic division algebras. Full-rate, full-diversity, non-vanishing determinant — the complete answer to the question "what does the Alamouti story become for $n_t > 2$?" Chapter 13 reference.

  • Differential space-time modulation (no CSI)

    B. M. Hochwald and W. Sweldens, "Differential unitary space-time modulation," IEEE Trans. Commun., vol. 48, no. 12, pp. 2041-2052, Dec. 2000.

    When the channel cannot be reliably estimated (high mobility), differential space-time modulation avoids the need for CSIR. The differential Alamouti scheme is a special case; extensions to $n_t > 2$ use unitary representations of finite groups. Useful reading for those interested in non-coherent space-time coding.

  • Lattice decoding and sphere decoder for STBCs

    M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.

    The sphere-decoder algorithm that makes lattice-based STBC decoding (LDC, CDA codes, LAST) practical. Typical complexity $O(M^{K/2})$ at moderate SNR. Required reading for practical LDC and CDA implementations. A CommIT-group paper (Caire as co-author).

  • Historical survey of space-time coding

    E. G. Larsson and P. Stoica, "Space-Time Block Coding for Wireless Communications," Cambridge University Press, 2003.

    An entire textbook on STBC theory and design, with detailed treatments of Alamouti, OSTBC, QOSTBC, and LDC plus many practical design examples. Complementary reading to this chapter; the Pareto-optimal reference if you want a deep dive on any one construction.

  • Bit-interleaved coded STBC (BICM + STBC)

    A. M. Tonello, "Space-time bit-interleaved coded modulation with an iterative decoding strategy," IEEE Trans. Commun., vol. 54, no. 11, pp. 2027-2036, Nov. 2006.

    Bridges the BICM framework of Part II of this book with the STBCs of Part III. Uses an outer binary code + bit interleaver + Alamouti / OSTBC inner code with iterative demapping. Relevant for Chapter 21's BICM-OFDM-STBC discussion.