How to design an efficient lattice coding scheme

Ram Zamir*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Lattice codes find applications in various digital communications settings, including shaping for power-constrained channels, coding with side information (dirty-paper channel, Wyner-Ziv source), and Gaussian networks. In this paper we deal neither with the construction of a good lattice, nor with algorithms for lattice coding and decoding, but with other elements of a lattice coding system. We shall consider (1) the two roles of the fundamental cell of the shaping lattice; (2) efficient mappings from information bits to a lattice point; (3) the loss due to a finite alphabet in construction-A lattices; (4) randomization with a simple dither; and (5) how to incorporate a multi-dimensional lattice into a sequential (feedback) scheme. While these are not new issues and observations, they seem to be somewhat overlooked or hidden inside the rich literature about lattice codes.

Original languageEnglish
Title of host publication2014 IEEE Information Theory Workshop, ITW 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages4
ISBN (Electronic)9781479959990
StatePublished - 1 Dec 2014
Event2014 IEEE Information Theory Workshop, ITW 2014 - Hobart, Australia
Duration: 2 Nov 20145 Nov 2014

Publication series

Name2014 IEEE Information Theory Workshop, ITW 2014


Conference2014 IEEE Information Theory Workshop, ITW 2014


  • construction A
  • dither
  • lattice encoding and decoding
  • modulo-lattice
  • prediction and equalization


Dive into the research topics of 'How to design an efficient lattice coding scheme'. Together they form a unique fingerprint.

Cite this