References

References

  1. S. M. Alamouti, A Simple Transmit Diversity Technique for Wireless Communications, IEEE Journal on Selected Areas in Communications, 1998

    The landmark paper proposing the $2 \times 1$ transmit diversity scheme that bears the author's name. One of the most cited papers in wireless communications, the Alamouti code achieves full diversity with a remarkably simple linear decoder and is adopted in 3G, 4G, and Wi-Fi standards.

  2. V. Tarokh, N. Seshadri, and A. R. Calderbank, Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction, IEEE Transactions on Information Theory, 1998

    Establishes the rank and determinant criteria for space-time code design and constructs families of space-time trellis codes. This paper, together with Alamouti's, founded the field of space-time coding.

  3. G. J. Foschini, Layered Space-Time Architecture for Wireless Communication in a Fading Environment When Using Multi-Element Antennas, Bell Labs Technical Journal, 1996

    The original D-BLAST paper showing that MIMO spectral efficiency grows linearly with the minimum number of antennas. A visionary paper that launched the MIMO revolution, though the practical V-BLAST simplification came two years later.

  4. D. Tse and P. Viswanath, Fundamentals of Wireless Communications, Cambridge University Press, 2005

    The primary textbook reference for MIMO communications. Chapters 7-10 cover MIMO channel capacity, space-time codes, the diversity-multiplexing trade-off, and MIMO transceiver architectures with exceptional clarity and mathematical rigour.

  5. D. J. Love and R. W. Heath Jr., Grassmannian Beamforming for Multiple-Input Multiple-Output Wireless Systems, IEEE Transactions on Information Theory, 2003

    Introduces the Grassmannian framework for limited-feedback beamforming, establishing that codebook design is a packing problem on the Grassmann manifold and deriving performance bounds for finite-rate feedback.

  6. L. Zheng and D. N. C. Tse, Diversity and Multiplexing: A Fundamental Tradeoff in Multiple-Antenna Channels, IEEE Transactions on Information Theory, 2003

    Derives the optimal diversity-multiplexing trade-off (DMT) for MIMO channels, providing a unified framework that connects space-time codes (diversity-oriented) and spatial multiplexing (rate-oriented) as points on a single curve.

  7. P. Elia, K. R. Kumar, S. A. Pawar, P. V. Kumar, and H.-F. Lu, Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff, IEEE Transactions on Information Theory, 2006

    Constructs the first explicit family of space-time codes that achieve the optimal diversity-multiplexing tradeoff for any number of antennas. A key contribution from the CommIT group (P. V. Kumar and collaborators with Caire).

  8. H. El Gamal, G. Caire, and M. O. Damen, Lattice Coding and Decoding Achieve the Optimal Diversity-Multiplexing Tradeoff of MIMO Channels, IEEE Transactions on Information Theory, 2003

    Shows that lattice space-time (LAST) codes achieve the optimal DMT, providing a constructive algebraic approach. A foundational CommIT contribution to MIMO coding theory.

  9. M. H. M. Costa, Writing on Dirty Paper, IEEE Transactions on Information Theory, 1983

    The foundational information-theoretic result showing that known interference at the transmitter can be completely pre-cancelled with no rate penalty. This "writing on dirty paper" theorem underlies DPC and the capacity analysis of the MIMO broadcast channel.

Further Reading

For readers who want to go deeper into specific topics from this chapter.

  • Space-time trellis codes and advanced STC designs

    Jafarkhani, "Space-Time Coding: Theory and Practice," Cambridge University Press, 2005

    Comprehensive treatment of space-time code design beyond orthogonal STBCs, including trellis codes, quasi-orthogonal designs, and differential space-time coding for non-coherent systems.

  • Sphere decoding for near-ML detection

    Agrell, Eriksson, Vardy, and Zeger, "Closest Point Search in Lattices," IEEE Trans. Inform. Theory, 2002

    Develops efficient algorithms for solving the closest lattice point problem, which directly applies to ML MIMO detection. Sphere decoding achieves ML performance with polynomial average complexity at moderate SNR.

  • Massive MIMO and spatial multiplexing at scale

    Marzetta, Larsson, Yang, and Ngo, "Fundamentals of Massive MIMO," Cambridge University Press, 2016

    Extends the MIMO concepts of this chapter to systems with hundreds of antennas, where favourable propagation simplifies receivers and precoding becomes near-optimal with simple linear processing.

  • MIMO-OFDM systems

    Bolcskei, Gesbert, and Paulraj, "On the Capacity of OFDM-Based Spatial Multiplexing Systems," IEEE Trans. Commun., 2002

    Bridges MIMO spatial multiplexing with OFDM for frequency- selective channels, the combination used in Wi-Fi 4/5/6 and LTE/5G NR.

  • Limited feedback for multi-user MIMO

    Jindal, "MIMO Broadcast Channels with Finite-Rate Feedback," IEEE Trans. Inform. Theory, 2006

    Extends the single-user limited feedback analysis to the multi-user broadcast channel, showing that the feedback rate must scale linearly with SNR (in dB) to maintain the multiplexing gain, a key result for cellular system design.

ExercisesCh 17 →