List decoding for nested lattices and applications to relay channels

We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. This list decoder is analogous to that used in random coding arguments in achievability schemes of relay channels, and allows for the effective combination of information from the relay and source node. Using this list decoding result, we demonstrate 1) that lattice codes may achieve the capacity of the physically degraded AWGN relay channel, 2) an achievable rate region for the two-way relay channel with direct links using lattice codes, and 3) that we may improve the constant gap to capacity for specific cases of the two-way relay channel with direct links.

[1]  Alexander Sprintson,et al.  Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.

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

[3]  Aydin Sezgin,et al.  Information Theory Capacity of the two-way relay channel within a constant gap , 2010, Eur. Trans. Telecommun..

[4]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit , 2009, ArXiv.

[5]  Liang-Liang Xie.  Network Coding and Random Binning for Multi-User Channels , 2007, 2007 10th Canadian Workshop on Information Theory (CWIT).

[6]  R. Zamir.  Lattices are everywhere , 2009, 2009 Information Theory and Applications Workshop.

[7]  Sang Joon Kim,et al.  Comparison of bi-directional relaying protocols , 2008, 2008 IEEE Sarnoff Symposium.

[8]  Suhas N. Diggavi,et al.  Approximately achieving Gaussian relay network capacity with lattice codes , 2010, 2010 IEEE International Symposium on Information Theory.

[9]  Te Sun Han,et al.  A general coding scheme for the two-way channel , 1984, IEEE Trans. Inf. Theory.

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

[11]  Armin Wittneben,et al.  Achievable Rate Regions for the Two-way Relay Channel , 2006, 2006 IEEE International Symposium on Information Theory.

[12]  Sae-Young Chung,et al.  Network Coding for Two-Way Relay Channels using Lattices , 2008, 2008 IEEE International Conference on Communications.

[13]  Sae-Young Chung,et al.  Nested Lattice Codes for Gaussian Relay Networks With Interference , 2011, IEEE Transactions on Information Theory.

[14]  Aydin Sezgin,et al.  Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network , 2012, IEEE Transactions on Information Theory.

[15]  Abhay Parekh,et al.  The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels , 2008, IEEE Transactions on Information Theory.

[16]  Sriram Vishwanath,et al.  Capacity of Symmetric K-User Gaussian Very Strong Interference Channels , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[17]  Sae-Young Chung,et al.  Noisy network coding , 2010 .

[18]  Lawrence Ong,et al.  Capacity Theorems for the AWGN multi-way relay channel , 2010, 2010 IEEE International Symposium on Information Theory.

[19]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

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

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

[22]  W. A. Coppel.  Number Theory: An Introduction to Mathematics , 2009 .

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

[24]  Andrea J. Goldsmith,et al.  The multi-way relay channel , 2009, 2009 IEEE International Symposium on Information Theory.