Joint network-channel code design for block fading cooperative multiple access channel

In this paper, we consider the half-duplex cooperative multiple-access channel (CMAC). We seek to design multiple turbo codes to minimize the information outage in the block fading channel. Since we consider an outage to occur even if the message of one of the sources fails to be decoded successfully, we employ a joint network-channel coding approach in our design. The codes are optimized using the extrinsic information transfer (EXIT) chart analysis, based on the convergence thresholds of the iterative decoding tailored for CMAC. Numerical examples shows that with our design technique, the achieved frame error rate is within 0.5 dB of the information outage, while a naive code optimized for each user separately performs 2 dB away from the information outage.

[1]  Marc Moeneclaey,et al.  Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels , 2009, IEEE Transactions on Information Theory.

[2]  Elza Erkip,et al.  Cooperative coding for wireless networks , 2004, IEEE Trans. Commun..

[3]  Alex J. Grant,et al.  Convergence analysis and optimal scheduling for multiple concatenated codes , 2005, IEEE Transactions on Information Theory.

[4]  Dariush Divsalar,et al.  Multiple turbo codes , 1995, Proceedings of MILCOM '95.

[5]  Matthew C. Valenti,et al.  Distributed turbo coded diversity for relay channel , 2003 .

[6]  Christoph Hausl,et al.  Communication Theory Joint network-channel coding for the multiple-access relay channel based on turbo codes , 2009, Eur. Trans. Telecommun..

[7]  Aria Nosratinia,et al.  Coded cooperation in wireless communications: space-time transmission and iterative decoding , 2004, IEEE Transactions on Signal Processing.

[8]  Hesham El Gamal,et al.  Analyzing the turbo decoder using the Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[9]  Thomas E. Fuja,et al.  Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels , 2006, IEEE Transactions on Information Theory.

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

[11]  Zheng Zhang,et al.  Capacity-approaching turbo coding and iterative decoding for relay channels , 2005, IEEE Transactions on Communications.

[12]  Marc Moeneclaey,et al.  Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels , 2009, IEEE Transactions on Information Theory.

[13]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[14]  Jun Hu,et al.  Low Density Parity Check Codes over Wireless Relay Channels , 2007, IEEE Transactions on Wireless Communications.

[15]  Aria Nosratinia,et al.  Cooperation diversity through coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

[17]  A. R. Hammons,et al.  Analyzing the turbo decoder using the Gaussian approximation , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[18]  Joseph J. Boutros,et al.  Analysis of coding on non-ergodic block-fading channels , 2005 .

[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]  Ashutosh Sabharwal,et al.  Low density parity check codes for the relay channel , 2007, IEEE Journal on Selected Areas in Communications.

[21]  Dariush Divsalar,et al.  Turbo codes for PCS applications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[22]  Jörg Kliewer,et al.  A network coding approach to cooperative diversity , 2007, IEEE Transactions on Information Theory.

[23]  A. H. W. Zhang,et al.  Capacity-Approaching Turbo Coding For Half-Duplex Relaying , 2007, IEEE Transactions on Communications.