On error exponents of nested lattice codes for the AWGN channel

We present a new lower bound for the error exponents of nested lattice codes for the additive white Gaussian noise (AWGN) channel. The exponents are closely related to those of an unconstrained additive noise channel where the noise is a weighted sum of a white Gaussian and a spherically uniform random vector. The new lower bound improves the previous result derived by Erez and Zamir (2002) and stated in terms of the Poltyrev exponents. More surprisingly, the new lower bound coincides with the random coding error exponents of the optimal Gaussian codes for the AWGN channel in the nonexpurgated regime. One implication of this result is that minimum mean squared error (MMSE) scaling, despite its key role in achieving capacity of the AWGN channel, is no longer fundamental in achieving the best error exponents for rates below channel capacity. These exponents are achieved using a lattice inflation parameter derived from a large-deviation analysis.

[1]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[2]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[3]  Brian L. Hughes,et al.  Exponential error bounds for random codes on Gaussian arbitrarily varying channels , 1991, IEEE Trans. Inf. Theory.

[4]  Gregory Poltyrev,et al.  On coding without restrictions for the AWGN channel , 1993, IEEE Trans. Inf. Theory.

[5]  Meir Feder,et al.  On lattice quantization noise , 1996, IEEE Trans. Inf. Theory.

[6]  Hans-Andrea Loeliger,et al.  Averaging bounds for lattices and linear codes , 1997, IEEE Trans. Inf. Theory.

[7]  R. Zamir,et al.  Lattice decoding can achieve 1/2 log(1+SNR) on the AWGN channel using nested codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[8]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[9]  R. Zamir,et al.  Lattice decoded nested codes achieve the Poltyrev exponent , 2002, Proceedings IEEE International Symposium on Information Theory,.

[10]  G. David Forney,et al.  On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener , 2004, ArXiv.

[11]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.