Code design for the relay channel and factor graph decoding

Recent information theoretical results have shown a considerable improvement in the performance of communication systems through the use of relaying and cooperation. Despite a collection of strong information theoretical results on the relay channel, there has been almost no attention to real code design for the relay channel. In this paper, we present a powerful modular code design approach for the relay channel and corresponding decoding algorithms based on the factor graph representation of the code. For most of the relay channel conditions, the constructed codes with a low-complexity simple relay protocol outperforms any possible code design for the direct channel by achieving an E/sub b//N/sub 0/ below the minimum required E/sub b//N/sub 0/ of single-link transmission. Moreover, the designed codes achieve a gap of less than 1 dB (at a BER of 10/sup -6/) to the Shannon limit for the relay channel with a code length of only 2 /spl times/ 10/sup 4/ bits.

[1]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

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

[3]  Ashutosh Sabharwal,et al.  Improved achievable rates for user cooperation and relay channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[4]  David Declercq,et al.  Low complexity code design for the 2-user Gaussian multiple access channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[5]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[6]  A. de Baynast.  Gallager Codes for Multiple User Applications , .

[7]  Mohammad Ali Khojastepour,et al.  Outage minimization and optimal power control for the fading relay channel , 2004, Information Theory Workshop.

[8]  Ashutosh Sabharwal,et al.  On the Capacity of 'Cheap' Relay Networks , 2003 .

[9]  Ashutosh Sabharwal,et al.  Lower Bounds on the Capacity of Gaussian Relay Channel , 2004 .

[10]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[11]  Ashutosh Sabharwal,et al.  On capacity of Gaussian 'cheap' relay channel , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).