User Cooperation with Punctured Turbo Codes

In wireless network transmission, a recently introduced form of spatial diversity, known as user cooperation diversity is an effective way to overcome deep fading. Cooperative users share their antennas and other resources to create a virtual array through distributed transmission and signal processing. In particular, the user cooperation technique is capable of providing sufficient diversity gain in many wireless systems where other conventional transmit diversity methods might not be practical. Recently proposed cooperative schemes rely on powerful channel codes suitable for cooperation. Here we study cooperative coding performance of punctured turbo codes for a quasi-static fading channel and a strict decoding delay constraint. Based on the threshold behavior analysis of the mother and punctured turbo codes, we derive a frame error rate (FER) upper bound for the cooperative coding scheme as a function of user-todestination SNRs, inter-user SNRs, the noise threshold of the mother turbo code, and the puncturing rate which relates the lengths of the originating and partnering users’ codeword transmissions. We show that the FER of cooperative turbo codes demonstrates the expected diversity gain for a sufficiently good inter-user channel quality.

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

[2]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[3]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

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

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

[6]  Elza Erkip,et al.  Increasing uplink capacity via user cooperation diversity , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[7]  D. Divsalar A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes , 1999 .

[8]  Harry Leib,et al.  Evaluating the performance of convolutional codes over block fading channels , 1999, IEEE Trans. Inf. Theory.

[9]  Raymond Knopp,et al.  On coding for block fading channels , 2000, IEEE Trans. Inf. Theory.

[10]  Robert J. McEliece,et al.  Coding theorems for turbo code ensembles , 2002, IEEE Trans. Inf. Theory.

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

[12]  Emina Soljanin,et al.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science Hybrid ARQ with Random Transmission Assignments , 2022 .

[13]  Emina Soljanin,et al.  Punctured turbo code ensembles , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

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

[15]  Elza Erkip,et al.  Cooperative coding for wireless networks , 2004, IEEE Transactions on Communications.