References & Further Reading

References

  1. G. D. Forney Jr., Coset codes — part I: introduction and geometrical classification, 1988

    The foundational paper of the lattice-coset-code framework. Introduces the partition-chain view, the fundamental coding gain, the shaping-gain decomposition, and the catalog of binary lattices. The single most cited reference in this chapter.

  2. G. D. Forney Jr., Coset codes — part II: binary lattices and related codes, 1988

    Companion to Part I. Catalogs the binary lattices ($\\mathbb{Z}^n$, $D_n$, $E_8$, $\\Lambda_{16}$, $\\Lambda_{24}$) and the binary partitions between them. Essential reading for anyone designing a coset-based TCM or MLC scheme.

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

    The encyclopaedic reference for lattice theory. Chapter 2 covers Voronoi regions, second moments, and the sphere-packing bound; Chapters 4–6 catalogue the canonical lattices ($D_n$, $E_n$, Barnes–Wall, Leech). Indispensable for any serious study of lattice codes.

  4. G. D. Forney Jr., Trellis shaping, 1992

    Introduces the trellis-shaping construction: a convolutional code on top of the base constellation drives a Viterbi search for the minimum-energy coset representative. Stacks cleanly with TCM to combine coding and shaping gain. Proposed for V.fast but not adopted.

  5. R. Laroia, N. Farvardin, and S. A. Tretter, On optimal shaping of multidimensional constellations, 1994

    Introduces the shell-mapping algorithm: a combinatorial arithmetic encoder over energy shells of a base PAM alphabet. Adopted in the V.34 voice-band modem standard (ITU-T Rec. V.34, 1998), contributing $\\approx 0.8$ dB of shaping gain.

  6. G. D. Forney Jr. and G. Ungerboeck, Modulation and coding for linear Gaussian channels, 1998

    Sweeping survey of coded modulation for the Gaussian channel. Places TCM, MLC/MSD, coset codes, and shaping in a unified framework. Section IX specifically covers shaping methods including shell mapping.

  7. G. D. Forney Jr., Multidimensional constellations — part II: Voronoi constellations, 1989

    Key paper on Voronoi constellations: a coding lattice intersected with the Voronoi region of a shaping lattice. Establishes the shaping-gain formula $\\gamma_s = 1/(12 G(\\Lambda_s))$ and proves the $\\pi e / 6$ ceiling.

  8. J. H. Conway and N. J. A. Sloane, A fast encoding method for lattice codes and quantizers, 1983

    Polynomial-time encoders for lattice-based Voronoi constellations. Precursor to shell mapping and all later "fast" shaping algorithms.

  9. R. F. H. Fischer, Precoding and Signal Shaping for Digital Transmission, Wiley-IEEE Press, 2002

    Book-length treatment of signal shaping and Tomlinson–Harashima precoding. Chapters 6–8 cover lattice shaping, shell mapping, and trellis shaping in substantially more depth than the present chapter; the natural follow-up for implementation-oriented readers.

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

    Modern lattice-codes reference with a networks twist. Chapters 2–3 cover the foundations we use in this chapter; Chapters 7–9 cover nested-lattice and modulo-lattice schemes that underlie the LAST codes of Ch. 17.

  11. E. Viterbo and J. Boutros, A universal lattice code decoder for fading channels, 1999

    The sphere decoder: a general closest-lattice-point algorithm that makes coset-code decoding tractable in moderate dimensions. Essential for any practical implementation of a non-trivial lattice code.

  12. A. R. Calderbank and N. J. A. Sloane, New trellis codes based on lattices and cosets, 1987

    Reformulates Ungerboeck's TCM in the lattice-coset language, opening the door to systematic TCM design. Shows that essentially every TCM code is a coset code for some partition chain.

  13. A. R. Calderbank, Multilevel codes and multistage decoding, 1989

    Clean exposition of multilevel coset codes and the multistage decoding principle. Bridge between MLC (Ch. 3) and coset codes (this chapter).

  14. G. D. Forney Jr., R. G. Gallager, G. R. Lang, F. M. Longstaff, and S. U. Qureshi, Efficient modulation for band-limited channels, 1984

    An early systematic analysis of the gap to Shannon capacity in digital modems, identifying the $1.53$ dB shaping gap. The first paper to state the shaping-gain ceiling clearly.

  15. T. M. Cover and J. A. Thomas, Elements of Information Theory, Wiley-Interscience, 2nd ed., 2006

    Source for the Gaussian maximum-entropy theorem (Thm. 8.6.5), the entropy-power inequality, and differential entropy bounds used in the proof of the shaping-gain ceiling in s04.

  16. G. Böcherer, F. Steiner, and P. Schulte, Bandwidth efficient and rate-matched low-density parity-check coded modulation, 2015

    Probabilistic amplitude shaping (PAS): a modern alternative to lattice shaping. Achieves $\\sim 1$ dB of shaping gain with an LDPC code and a distribution matcher. Forward reference to Ch. 19.

  17. ITU-T, A modem operating at data signalling rates of up to 33 600 bit/s for use on the general switched telephone network and on leased point-to-point 2-wire telephone-type circuits, 1998. [Link]

    The V.34 voice-band modem standard. Uses a 4-D coset code with 16-D shell-mapping shaping. Last significant deployment of lattice coset codes in a consumer standard.

  18. G. Ungerboeck, Channel coding with multilevel/phase signals, 1982

    Ungerboeck's foundational TCM paper. Establishes the set-partitioning principle that underlies the entire coset-code framework.

Further Reading

For readers who want to go deeper into lattice theory, the geometry of coset codes, the connection to network information theory, or the probabilistic-shaping alternative.

  • Lattice geometry and the densest known packings

    J. H. Conway and N. J. A. Sloane, *Sphere Packings, Lattices and Groups*, 3rd ed., Springer, 1999 — especially Chapters 1–6 and the Table 1.2 of best known lattices.

    The single most comprehensive reference. Contains exact values of $V(\\Lambda)$, $K(\\Lambda)$, $G(\\Lambda)$, and coding gains for every lattice mentioned in this chapter, and many more.

  • Nested lattices and modulo-lattice schemes

    R. Zamir, *Lattice Coding for Signals and Networks*, Cambridge University Press, 2014 — Chapters 7–9.

    The natural sequel for readers interested in lattice codes for multi-terminal networks, Gelfand–Pinsker/Costa schemes, and interference alignment. Direct preparation for Chs. 16–18.

  • Practical lattice-based coded modulation

    R. F. H. Fischer, *Precoding and Signal Shaping for Digital Transmission*, Wiley-IEEE Press, 2002 — Chapters 6–8.

    Implementation-oriented treatment of lattice shaping, shell mapping, and trellis shaping. Complements our more theoretical exposition.

  • Probabilistic shaping as a modern alternative

    G. Böcherer, F. Steiner, and P. Schulte, "Bandwidth-efficient and rate-matched low-density parity-check coded modulation," *IEEE Trans. Commun.*, vol. 63, no. 12, pp. 4651–4665, Dec. 2015.

    The modern alternative to lattice shaping, deployed in DVB-S2X and optical coherent links. Reaches $\\sim 1$ dB of shaping gain with a distribution matcher and an LDPC code. Ch. 19 will cover the architecture in detail.

  • The geometric view of coded modulation

    G. D. Forney Jr. and G. Ungerboeck, "Modulation and coding for linear Gaussian channels," *IEEE Trans. Inform. Theory*, vol. 44, no. 6, pp. 2384–2415, Oct. 1998.

    A magisterial synthesis by the two authors most responsible for modern coded modulation. Reading this paper cover-to-cover is the best single investment a student can make in this subject.

ExercisesCh 5 →