Unequal Diversity LDPC Codes for Relay Channels

A novel protograph-based construction of low-density parity-check (LDPC) codes for the relay channel is proposed, which provides an enhanced unequal error protection property named unequal diversity. The focus is on quasi-static fading channels and on the high-code-rate (R>1/2) regimes, for which (according to the Singleton bound) no full diversity can be achieved. In the proposed construction, some nodes (and the corresponding codeword fragment) associated with the code graph enjoy the diversity provided by the relay, whereas the remaining nodes do not experience any diversity. The proposed approach can be thus tailored to transmit information blocks with different priority levels. An extrinsic information transfer (EXIT) analysis is developed, which allows an accurate performance prediction over the considered channel model, and more in general over block-fading channels.

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

[2]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[3]  Richard D. Wesel,et al.  Protograph-Based Raptor-Like LDPC Codes for Rate Compatibility with Short Blocklengths , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[4]  Marco Chiani.  Error probability for block codes over channels with block interference , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[5]  T. Richardson,et al.  Multi-Edge Type LDPC Codes , 2004 .

[6]  Aria Nosratinia,et al.  Bilayer Protograph Codes for Half-Duplex Relay Channels , 2013, IEEE Trans. Wirel. Commun..

[7]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[8]  Wayne E. Stark,et al.  Channels with block interference , 1984, IEEE Trans. Inf. Theory.

[9]  Dariush Divsalar,et al.  Low-rate LDPC codes with simple protograph structure , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[10]  R. M. Tanner.  On Quasi-Cyclic Repeat-Accumulate Codes , 2000 .

[11]  Joseph J. Boutros,et al.  Analysis of coding on non-ergodic block-fading channels , 2005 .

[12]  Li Ping,et al.  Concatenated tree codes: A low-complexity, high-performance approach , 2001, IEEE Trans. Inf. Theory.

[13]  Giulio Colavolpe,et al.  Design and performance of turbo Gallager codes , 2004, IEEE Transactions on Communications.

[14]  Ezio Biglieri,et al.  Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[15]  Marco Chiani,et al.  Evaluation of low-density parity-check codes over block fading channels , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[16]  Gerhard Fettweis,et al.  Exact erasure channel density evolution for protograph-based generalized LDPC codes , 2009, 2009 IEEE International Symposium on Information Theory.

[17]  Dariush Divsalar,et al.  Capacity-approaching protograph codes , 2009, IEEE Journal on Selected Areas in Communications.

[18]  D. Saad,et al.  Error-correcting codes that nearly saturate Shannon's bound , 1999, cond-mat/9906011.

[19]  Aria Nosratinia,et al.  Diversity through coded cooperation , 2006, IEEE Transactions on Wireless Communications.

[20]  William E. Ryan,et al.  Quasi-Cyclic Generalized LDPC Codes With Low Error Floors , 2007, IEEE Trans. Commun..

[21]  Sae-Young Chung,et al.  On the construction of some capacity-approaching coding schemes , 2000 .

[22]  Hui Jin,et al.  Block Error Iterative Decoding Capacity for LDPC Codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[23]  Dariush Divsalar,et al.  Accumulate repeat accumulate codes , 2004, ISIT.

[24]  Marc Moeneclaey,et al.  Analysis and Construction of Full-Diversity Joint Network-LDPC Codes for Cooperative Communications , 2010, EURASIP J. Wirel. Commun. Netw..

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

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

[27]  Yifei Zhang,et al.  Structured IRA Codes: Performance Analysis and Construction , 2007, IEEE Transactions on Communications.

[28]  J. Thorpe.  Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[29]  Michael Lentmaier,et al.  An analysis of the block error probability performance of iterative decoding , 2005, IEEE Transactions on Information Theory.

[30]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

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

[32]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[33]  Jiaru Lin,et al.  Cooperative diversity through network turbo-coding , 2007, 2007 International Conference on Communications, Circuits and Systems.

[34]  Shu Lin,et al.  Channel Codes: Classical and Modern , 2009 .

[35]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

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

[37]  Marco Chiani,et al.  Protograph LDPC Codes Design Based on EXIT Analysis , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.