Design of complexity-optimized bilayer lengthened LDPC codes for relay channels

We propose a technique to design complexity-optimized bilayer lengthened LDPC codes by generalizing EXIT charts to bilayer codes and applying a method to estimate the number of decoding iterations. Using this approach, we have designed bilayer lengthened LDPC codes with a relay decoding complexity reduced up to 60% compared to the highest rate codes designed in the literature.

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

[2]  Peyman Razaghi,et al.  Parity Forwarding for Relay Networks , 2010 .

[3]  Jun Ning,et al.  Improved bilayer LDPC codes using irregular check node degree distribution , 2008, 2008 IEEE International Symposium on Information Theory.

[4]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

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

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

[7]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[8]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[9]  Masoud Salehi,et al.  Design of bilayer lengthened LDPC codes for Rayleigh fading relay channels , 2011, 2011 45th Annual Conference on Information Sciences and Systems.

[10]  Wei Yu,et al.  Design of irregular LDPC codes with optimized performance-complexity tradeoff , 2010, IEEE Transactions on Communications.