Achieving$ 1over 2log (1+ hboxSNR)$on the AWGN Channel With Lattice Encoding and Decoding
Top Cited Papers
- 27 September 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 50 (10) , 2293-2314
- https://doi.org/10.1109/tit.2004.834787
Abstract
We address an open question, regarding whether a lattice code with lattice decoding (as opposed to maximum-likelihood (ML) decoding) can achieve the additive white Gaussian noise (AWGN) channel capacity. We first demonstrate how minimum mean-square error (MMSE) scaling along with dithering (lattice randomization) techniques can transform the power-constrained AWGN channel into a modulo-lattice additive noise channel, whose effective noise is reduced by a factor of /spl radic/(1+SNR/SNR). For the resulting channel, a uniform input maximizes mutual information, which in the limit of large lattice dimension becomes 1/2 log (1+SNR), i.e., the full capacity of the original power constrained AWGN channel. We then show that capacity may also be achieved using nested lattice codes, the coarse lattice serving for shaping via the modulo-lattice transformation, the fine lattice for channel coding. We show that such pairs exist for any desired nesting ratio, i.e., for any signal-to-noise ratio (SNR). Furthermore, for the modulo-lattice additive noise channel lattice decoding is optimal. Finally, we show that the error exponent of the proposed scheme is lower bounded by the Poltyrev exponent.Keywords
This publication has 28 references indexed in Scilit:
- Random codes: minimum distances and error exponentsIEEE Transactions on Information Theory, 2002
- Error exponents of modulo-additive noise channels with side information at the transmitterIEEE Transactions on Information Theory, 2001
- On the Existence of Similar SublatticesCanadian Journal of Mathematics, 1999
- The art of signaling: fifty years of coding theoryIEEE Transactions on Information Theory, 1998
- Averaging bounds for lattices and linear codesIEEE Transactions on Information Theory, 1997
- Information rates of pre/post-filtered dithered quantizersIEEE Transactions on Information Theory, 1996
- Some optimal codes have structureIEEE Journal on Selected Areas in Communications, 1989
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983
- Voronoi regions of lattices, second moments of polytopes, and quantizationIEEE Transactions on Information Theory, 1982
- Group codes for the Gaussian channel (Abstr.)IEEE Transactions on Information Theory, 1968