Code design for multiple-access multiple-relay wireless channels with non-orthogonal transmission

In this paper, we study the benefit of Joint Network Channel Coding (JNCC) and Decoding (JNCD) for half-duplex slow fading Multiple-Access Multiple-Relay Channels (MAMRC), defined as follows: (1) Multiple statistically independent sources communicate with a single destination with the help of multiple relays; (2) Each relay is half-duplex; (3) The links between the different nodes are subject to slow fading and additive white Gaussian noise; (4) Some links interfere. Channel State Information (CSI) is available only at the receivers (relays or destination) and assumed perfect. While the Multiple Access (MA) function is presented generically depending on how the resources are allocated to the sources and relays, the emphasis is on the most spectrally-efficient Non-Orthogonal Multiple-Access (NOMA) where sources and cooperating relays interfere. The relays perform JNCC in combination with Selective Relaying (SR), meaning that they forward a function of the correctly decoded sources' packets to the destination. Practical linear JNCC schemes and the corresponding JNCD architectures are described in detail for NOMA, and shown to perform close to the theoretical limits.

[1]  Antoine Berthet,et al.  Practical joint network-channel coding schemes for orthogonal multiple-access multiple-relay channels , 2014, GLOBECOM 2014.

[2]  Ming Xiao,et al.  Binary Field Network Coding Design for Multiple-Source Multiple-Relay Networks , 2011, 2011 IEEE International Conference on Communications (ICC).

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

[4]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[5]  Zheng Guo,et al.  A Practical Joint Network-Channel Coding Scheme for Reliable Communication in Wireless Networks , 2009, IEEE Transactions on Wireless Communications.

[6]  Raphaël Visoz,et al.  Joint Channel-Network Coding for the Semi-Orthogonal Multiple Access Relay Channel , 2010, 2010 IEEE 72nd Vehicular Technology Conference - Fall.

[7]  Raphaël Visoz,et al.  Outage achievable rate analysis for the Non Orthogonal Multiple Access Multiple Relay Channel , 2013, 2013 IEEE Wireless Communications and Networking Conference Workshops (WCNCW).

[8]  D.H. Woldegebreal,et al.  Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay Channels , 2007, 2007 4th International Symposium on Wireless Communication Systems.

[9]  Sidharth Jaggi,et al.  Low Complexity Encoding for Network Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[10]  J. Boutros,et al.  Iterative multiuser joint decoding: unified framework and asymptotic analysis , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[11]  Harry Leib,et al.  Coded Diversity on Block-Fading Channels , 1999, IEEE Trans. Inf. Theory.

[12]  Giuseppe Caire,et al.  Bit-Interleaved Coded Modulation , 2008, Found. Trends Commun. Inf. Theory.

[13]  Raphaël Visoz,et al.  Joint channel-network turbo coding for the non-orthogonal multiple access relay channel , 2010, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[14]  X. Jin Factor graphs and the Sum-Product Algorithm , 2002 .

[15]  Raphaël Visoz,et al.  Practical joint network-channel coding schemes for slow-fading orthogonal multiple-access multiple-relay channels , 2014, 2014 IEEE Globecom Workshops (GC Wkshps).

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

[17]  M. Skoglund,et al.  Design of Network Codes for Multiple-User Multiple-Relay Wireless Networks , 2012, IEEE Trans. Commun..

[18]  R. E. Miles Poisson flats in Euclidean spaces Part II: Homogeneous Poisson flats and the complementary theorem , 1971, Advances in Applied Probability.