Achieving the ergodic capacity with lattice codes

The performance of lattice codes in the additive white Gaussian noise (AWGN) channel has attracted much attention lately, however, their performance under ergodic fading channels has been relatively unexplored. We show that lattice coding and decoding achieve the capacity of the ergodic point-to-point and multiple-access channels (MAC). Additionally, a low-complexity scheme is proposed for the ergodic MAC. At moderate and high signal-to-noise ratio (SNR), the sum rate achieved by the low-complexity scheme is within a constant gap to the ergodic MAC sum capacity, whereas at low SNR the gap to capacity diminishes quadratically with linear SNR decrease.

[1]  Uri Erez,et al.  The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel , 2014, IEEE Trans. Inf. Theory.

[2]  R. Zamir,et al.  On lattice quantization noise , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[3]  Aria Nosratinia,et al.  Approaching the ergodic capacity with lattice coding , 2014, 2014 IEEE Global Communications Conference.

[4]  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.

[5]  Yuval Kochman,et al.  Lattice Coding for Signals and Networks: Lattice shaping , 2014 .

[6]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.

[7]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[8]  Giuseppe Caire,et al.  Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels , 2004, IEEE Transactions on Information Theory.

[9]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[10]  Uri Erez,et al.  The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel , 2012, IEEE Transactions on Information Theory.

[11]  Natasha Devroye,et al.  Lattice Codes for the Gaussian Relay Channel: Decode-and-Forward and Compress-and-Forward , 2011, IEEE Transactions on Information Theory.

[12]  Yi Hong,et al.  On the ergodic rate for compute-and-forward , 2012, 2012 International Symposium on Network Coding (NetCod).

[13]  Simon Litsyn,et al.  Lattices which are good for (almost) everything , 2005, IEEE Transactions on Information Theory.

[14]  János Körner,et al.  How to encode the modulo-two sum of binary sources (Corresp.) , 1979, IEEE Trans. Inf. Theory.

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