Design of Nested LDGM-LDPC Codes for Compress-and-Forward in Relay Channel

A three terminal relay system with binary erasure channel (BEC) was considered, in which a source forwarded information to a destination with a relay's "assistance". The nested LDGM (Low-density generator-matrix) -LDPC (low-density parity-check) was designed to realize Compress-and-forward (CF) at the relay. LDGM coding compressed the received signals losslessly and LDPC realized the binning for Slepian-Wolf coding. Firstly a practical coding scheme was proposed to achieve the cut-set bound on the capacity of the system, employing LDPC and Nested LDGM-LDPC codes at the source and relay respectively. Then, the degree distribution of LDGM and LDPC codes was optimized with a given rate bound, which ensured that the iterative belief propagation (BP) decoding algorithm at the destination was convergent. Finally, simulations results show that the performance achieved based on nested codes is very close to Slepian-Wolf theoretical limit.

[1]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[2]  Zixiang Xiong,et al.  Wyner-Ziv coding for the half-duplex relay channel , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[3]  Chen He,et al.  Practical Dirty Paper Coding with Nested Binary LDGM-LDPC Codes , 2009, 2009 IEEE International Conference on Communications.

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

[5]  Andrea Montanari,et al.  Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding , 2005, IEEE Transactions on Information Theory.

[6]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[7]  M. Luby,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[8]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[9]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[10]  Zixiang Xiong,et al.  Joint source-channel coding of binary sources with side information at the decoder using IRA codes , 2002, 2002 IEEE Workshop on Multimedia Signal Processing..

[11]  Chen He,et al.  Design and Analysis of LDGM-Based Codes for MSE Quantization , 2008, ArXiv.

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

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

[14]  Chen He,et al.  Approaching 1.53-dB Shaping Gain with LDGM Quantization Codes , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[15]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[16]  J. Wolfowitz.  The rate distortion function for source coding with side information at the decoder , 1979 .

[17]  Zixiang Xiong,et al.  Compression of binary sources with side information at the decoder using LDPC codes , 2002, IEEE Communications Letters.

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

[19]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.