Distributed Turbo Product Codes over Multiple Relays

In this paper, we propose a Distributed Turbo Product Code (DTPC) over cooperative network using block Bose Chaudhuri Hochquenghem (BCH) codes as component codes. The source broadcasts extended BCH coded frames to the destination and nearby relays. After decoding the received sequences, each relay constructs a product code by arranging the corrected bit sequences in rows and re-encoding them vertically using BCH as component codes to obtain an Incremental Redundancy (IR) for source's data. To obtain independent vertical parities from each relay in the same code space, different circular interleavers are proposed to interleave BCH rows before reencoding vertically. A modified turbo product decoder to cope with Multiple Vertical Parities (MVP) is used at the destination to iteratively decode the systematic data from the source and the vertical parities generated by the relays. Simulation results in Additive White Gaussian Noise (AWGN) channel using network scenarios show 0.3-0.5dB gain improvement in Bit Error Rate (BER) performance over the non-cooperative Turbo Product Codes (TPC).

[1]  A. Host-Madsen,et al.  Cooperative diversity for wireless ad hoc networks , 2006, IEEE Signal Processing Magazine.

[2]  Reginaldo Palazzo,et al.  Modified Berlekamp-Massey algorithm for decoding BCH codes defined over rings , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[3]  Ivan J. Fair,et al.  PAPR reduction of OFDM signals using partial transmit sequence: an optimal approach using sphere decoding , 2005, IEEE Communications Letters.

[4]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[5]  Lajos Hanzo,et al.  Turbo Coding, Turbo Equalisation and Space-Time Coding for Transmission over Fading Channels , 2002 .

[6]  Guosen Yue,et al.  LDPC-coded cooperative relay systems: performance analysis and code design , 2008, IEEE Transactions on Communications.

[7]  Yousef R. Shayan,et al.  Distance-based-decoding of block turbo codes , 2005, IEEE Communications Letters.

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

[9]  Ramesh Pyndiah,et al.  Near optimum decoding of product codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[10]  Ashutosh Sabharwal,et al.  Low density parity check codes for the relay channel , 2007, IEEE Journal on Selected Areas in Communications.

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