Multiuser Lattice Coding for the Multiple-Access Relay Channel

This paper considers the multiantenna multiple-access relay channel (MARC), in which multiple users transmit messages to a common destination with the assistance of a relay. In a variety of MARC settings, the dynamic decode-and-forward (DDF) protocol is very useful due to its outstanding rate performance. However, the lack of good structured codebooks so far hinders practical applications of DDF for MARC. In this work, two classes of structured MARC codes are proposed: 1) one-to-one relay-mapper-aided multiuser lattice coding (O-MLC); and 2) modulo-sum relay-mapper-aided multiuser lattice coding (MS-MLC). The former enjoys better rate performance, whereas the latter provides more flexibility to tradeoff between the complexity of the relay mapper and the rate performance. It is shown that, in order to approach the rate performance achievable by an unstructured codebook with maximum-likelihood decoding, it is crucial to use a new K-stage coset decoder for structured O-MLC instead of the one-stage decoder proposed in previous works. However, if O-MLC is decoded with the one-stage decoder only, it can still achieve the optimal DDF diversity-multiplexing gain tradeoff in the high signal-to-noise ratio regime. As for MS-MLC, its rate performance can approach that of the O-MLC by increasing the complexity of the modulo-sum relay-mapper. Finally, for practical implementations of both O-MLC and MS-MLC, practical short-length lattice codes with linear mappers are designed, which facilitate efficient lattice decoding. Simulation results show that the proposed coding schemes outperform existing schemes in terms of outage probabilities in a variety of channel settings, especially when the users-to-relay links are better than the other channel links.

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

[2]  M. O. Damen,et al.  A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, SPAWC 2005.

[3]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[4]  Luc Vandendorpe,et al.  Compute-and-Forward on a Multiaccess Relay Channel: Coding and Symmetric-Rate Optimization , 2012, IEEE Transactions on Wireless Communications.

[5]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[6]  Georgios B. Giannakis,et al.  Complex Field Network Coding for Multiuser Cooperative Communications , 2008, IEEE Journal on Selected Areas in Communications.

[7]  Rüdiger L. Urbanke,et al.  A rate-splitting approach to the Gaussian multiple-access channel , 1996, IEEE Trans. Inf. Theory.

[8]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[9]  Michael Gastpar,et al.  Computation Over Multiple-Access Channels , 2007, IEEE Transactions on Information Theory.

[10]  Luc Vandendorpe,et al.  Compress-and-forward on a multiaccess relay channel with computation at the receiver , 2013, 2013 IEEE International Conference on Communications (ICC).

[11]  Luc Vandendorpe,et al.  Resource allocation for multiple access relay channel with a compute-and-forward relay , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[12]  Elza Erkip,et al.  Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective , 2007, IEEE Transactions on Information Theory.

[13]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[14]  Giuseppe Caire,et al.  Coding and Decoding for the Dynamic Decode and Forward Relay Protocol , 2009, IEEE Transactions on Information Theory.

[15]  J. Nicholas Laneman,et al.  A Case for Amplify–Forward Relaying in the Block-Fading Multiple-Access Channel , 2008, IEEE Transactions on Information Theory.

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

[17]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

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

[19]  Christoph Hausl,et al.  Joint Network-Channel Coding for the Multiple-Access Relay Channel , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[20]  Abdelaziz Amraoui,et al.  Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[21]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[22]  Lizhong Zheng,et al.  Diversity-multiplexing tradeoff in multiple-access channels , 2004, IEEE Transactions on Information Theory.

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

[24]  R. Muirhead Aspects of Multivariate Statistical Theory , 1982, Wiley Series in Probability and Statistics.

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

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

[27]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[28]  Luc Vandendorpe,et al.  Iterative sum-rate optimization for multiple access relay channels with a compute-and-forward relay , 2012, 2012 IEEE International Conference on Communications (ICC).

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

[30]  Hesham El Gamal,et al.  On the Optimality of Lattice Coding and Decoding in Multiple Access Channels , 2007, 2007 IEEE International Symposium on Information Theory.

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

[32]  Giuseppe Caire,et al.  A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[33]  Philip Schniter,et al.  On the Optimality of the ARQ-DDF Protocol , 2008, IEEE Transactions on Information Theory.

[34]  Gerhard Kramer,et al.  Capacity Theorems for the Multiple-Access Relay Channel , 2004 .

[35]  A.J. van Wijngaarden,et al.  On the white Gaussian multiple-access relay channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).