A modulo-lattice transformation for multiple-access channels

A simple lemma is derived that allows to transform a general single-user (non-Gaussian, non-additive) continuous-alphabet channel as well as a general multiple-access channel into a modulo-additive noise channel. While in general the transformation is information lossy, it allows to leverage linear coding techniques and capacity results derived for networks comprised of additive Gaussian nodes to more general networks.

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

[2]  Uri Erez,et al.  Lattice Strategies for the Dirty Multiple Access Channel , 2007, IEEE Transactions on Information Theory.

[3]  Sae-Young Chung,et al.  Capacity Bounds for Two-Way Relay Channels , 2008, 2008 IEEE International Zurich Seminar on Communications.

[4]  Michael Gastpar,et al.  Compute-and-forward: Harnessing interference with structured codes , 2008, 2008 IEEE International Symposium on Information Theory.

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

[6]  S. Sandeep Pradhan,et al.  Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function , 2007, IEEE Transactions on Information Theory.

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

[8]  M. Gastpar,et al.  Compute-and-forward: A novel strategy for cooperative networks , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[9]  Michael Gastpar,et al.  The case for structured random codes in network capacity theorems , 2008, Eur. Trans. Telecommun..

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

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