References & Further Reading

References

  1. H. El Gamal, G. Caire, and M. O. Damen, Lattice Coding and Decoding Achieve the Optimal Diversity-Multiplexing Tradeoff of MIMO Channels, 2004

    The foundational CommIT-group paper on LAST codes. Introduces the construction (nested lattice codes over MIMO) and proves DMT-optimality via MMSE-GDFE + lattice decoding. Section III is the main theorem; Section IV compares with CDA codes and V-BLAST.

  2. K. R. Kumar and G. Caire, Space-Time Codes from Structured Lattices, 2009

    The CommIT-group constructive companion to El Gamal-Caire-Damen (2004). Shows that replacing the random fine lattice by $E_8$, Leech, or Barnes-Wall preserves DMT-optimality and gains $3-6$ dB of finite-SNR coding gain. The conference version appeared in 2008; the journal version is 2009. Commonly cited as "Kumar-Caire 2008."

  3. U. Erez and R. Zamir, Achieving $\tfrac{1}{2} \log(1 + \mathrm{SNR})$ on the AWGN channel with lattice encoding and decoding, 2004

    The foundational proof that nested lattice codes with MMSE scaling and common random dithering achieve the AWGN capacity. Provides the "AWGN half" of the LAST argument β€” the MIMO side is El-Gamal-Caire-Damen's MMSE-GDFE triangularisation. Chapter 16 of this book covers the proof in detail.

  4. L. Zheng and D. N. C. Tse, Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels, 2003

    The canonical paper defining the diversity-multiplexing tradeoff for i.i.d. Rayleigh MIMO channels. Proves the Zheng-Tse curve $d^*(r) = (n_t - r)(n_r - r)$ for $r \\in \\{0, 1, \\ldots, \\min(n_t, n_r)\\}$, piecewise-linearly interpolated. The benchmark against which LAST codes are measured.

  5. 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 CommIT-group CDA-NVD paper (Ch. 13). Gives explicit DMT-optimal codes for arbitrary $(n_t, n_r)$ via cyclic division algebras with non-vanishing determinant. The algebraic counterpart to LAST's information-theoretic construction.

  6. G. J. Foschini, Layered Space-Time Architecture for Wireless Communication in a Fading Environment When Using Multi-Element Antennas, 1996

    Foschini's original diagonal-BLAST paper. The conceptual ancestor of V-BLAST and MMSE-SIC, which in turn inspired the MMSE-GDFE of LAST decoding.

  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

    The V-BLAST paper. Practical layered MIMO architecture with ZF or MMSE detection and successive interference cancellation. The precursor of the MMSE-GDFE receiver used in LAST decoding.

  8. M. O. Damen, H. El Gamal, and G. Caire, On maximum-likelihood detection and the search for the closest lattice point, 2003

    Companion paper to El Gamal-Caire-Damen 2004. Refines the sphere decoder complexity analysis ($O(M^{n_t T / 2})$ average at high SNR) and proposes the augmented-matrix/QR structure that became the MMSE-GDFE. Essential reference for sphere-decoder practitioners.

  9. E. Viterbo and J. Boutros, A Universal Lattice Code Decoder for Fading Channels, 1999

    The modern-form sphere decoder: a general closest-lattice-point algorithm applicable to any lattice. Essential for practical ML decoding of LAST and CDA codes in moderate dimensions. The LTE uplink receiver's decoder descends from this paper.

  10. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, Springer, 3rd ed., 1999

    The encyclopaedic lattice-theoretic reference. Chapters 4-5 catalogue $E_8$, Leech, Barnes-Wall, and the root lattices that serve as inner lattices in structured LAST. Table 1.2 tabulates packing densities and kissing numbers.

  11. R. Zamir, Lattice Coding for Signals and Networks, Cambridge University Press, 2014

    Modern lattice-codes reference with networks emphasis. Chapter 9 covers the LAST construction in detail; Chapters 7-8 cover nested- lattice codes underlying LAST. The definitive pedagogical treatment of the material in this chapter.

  12. J.-C. Belfiore, G. Rekaya, and E. Viterbo, The Golden Code: A $2 \times 2$ Full-Rate Space-Time Code with Non-vanishing Determinants, 2005

    The Golden code paper. Introduces the $2 \\times 2$ full-rate DMT-optimal space-time code based on the golden-ratio algebraic extension. The CDA-NVD benchmark against which structured LAST codes are compared in Β§5.

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

    Standard textbook. Chapter 8 covers MMSE-SIC and the MIMO sum capacity; Chapter 9 covers DMT and space-time codes. Written contemporaneously with the El Gamal-Caire-Damen 2004 paper and adopts many of its conventions.

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

    The Linear Dispersion Code (LDC) framework β€” the most general structure for linear space-time codes. CDA codes and LAST codes are both instances of this framework. Useful for placing LAST in the broader linear-STC landscape.

  15. B. Hassibi and H. Vikalo, On the sphere-decoding algorithm I. Expected complexity, 2005

    Detailed analysis of sphere-decoder expected complexity β€” polynomial at high SNR, exponential at low SNR. The theoretical basis for when sphere decoding is deployable and when it is not.

  16. S. Tavildar and P. Viswanath, Approximately universal codes over slow-fading channels, 2006

    Introduces the notion of approximate universality β€” a code that achieves the DMT under any fading distribution with regular density. Used in Ch. 13 to establish universality of CDA-NVD codes and in Ch. 17 discussions.

  17. J. Boutros, G. Caire, E. Viterbo, and M. O. Damen, Good lattice constellations for both Rayleigh fading and Gaussian channels, 2003

    Early CommIT-group work on lattice constellations robust to both fading and AWGN. Conceptual precursor to LAST β€” it explores the same design space in the single-antenna fading setting.

  18. B. Nazer and M. Gastpar, Compute-and-forward: Harnessing interference through structured codes, 2011

    The compute-and-forward paper. Extends LAST-style lattice codes to multi-user relay networks, with the relay decoding lattice equations instead of individual messages. Forward reference to Ch. 18 of this book.

  19. D. S. Millar, T. Koike-Akino, M. Kojima, and K. Parsons, Experimental Demonstration of High Dimensional 4D-Set Partitioning, 2014

    Experimental demonstration of $E_8$-coded coherent optical transmission at 200G β€” the practical deployment of lattice constellations in fiber-optic systems.

  20. 3GPP, NR; Physical channels and modulation (Release 16), 2020

    5G NR physical layer specification. Section 6.3 defines the MIMO precoding codebook (Type I/II); Section 7.4 defines the reference signals. Confirms that 5G NR uses codebook-based precoding with CSIT, not LAST codes.

Further Reading

For readers who want to go deeper into LAST codes, lattice-based MIMO decoders, and the transition to multi-user lattice coding.

  • The complete LAST theory β€” textbook treatment

    R. Zamir, *Lattice Coding for Signals and Networks*, Cambridge University Press, 2014 β€” Chapters 7-9.

    The definitive modern exposition. Chapter 9 covers LAST in depth, including the MMSE-GDFE derivation, DMT optimality, and the structured-lattice extensions. Pedagogically oriented.

  • Integer-forcing linear receivers β€” a modern alternative

    J. Zhan, B. Nazer, U. Erez, M. Gastpar, "Integer-Forcing Linear Receivers," IEEE Transactions on Information Theory, vol. 60, no. 12, pp. 7661-7685, Dec. 2014.

    Integer-forcing receivers achieve near-LAST performance with lower complexity by decoding an integer combination of the streams instead of each stream separately. The natural successor to MMSE-GDFE for lattice codes, and a good window into current research in this area.

  • Lattice reduction for space-time decoding

    H. Yao, G. Wornell, "Lattice-reduction-aided detectors for MIMO communication systems," Proc. IEEE Globecom 2002, pp. 424-428.

    An alternative approach that preprocesses the channel with LLL-reduction (polynomial time) before applying MMSE, achieving full diversity at lower complexity than sphere decoding.

  • Compute-and-forward (forward reference to Ch. 18)

    B. Nazer, M. Gastpar, "Compute-and-Forward: Harnessing Interference Through Structured Codes," IEEE Transactions on Information Theory, 2011.

    The natural next step for LAST codes β€” applying the nested- lattice construction to multi-user relay networks. The CAF receiver is a structural generalisation of MMSE-GDFE. Essential reading before Ch. 18.

  • Sphere decoding complexity β€” definitive references

    B. Hassibi, H. Vikalo, "On the sphere-decoding algorithm I: Expected complexity; II: Generalizations, second-order statistics, and applications to communications," IEEE Trans. Sig. Proc., 2005.

    Rigorous complexity analysis of sphere decoding, clarifying when it is polynomial (high SNR) and when it is exponential (low SNR, high rate). Essential for anyone designing a real-time sphere-decoder receiver.

  • Lattice-coded optical communication

    T. Koike-Akino, D. S. Millar, K. Parsons, et al., "Constellation Shaping and Multi-Dimensional Modulation in Coherent Optical Systems," Optical Fiber Communication Conference (OFC) tutorials, 2015-2020 editions.

    The practical deployment window for $E_8$-based lattice codes: coherent fiber-optic systems at 200G-400G. Covers the design and laboratory demonstration of $E_8$-coded optical transmission.