On the UEP Capabilities of Several LDPC Construction Algorithms

This paper analyzes construction algorithms for low-density parity-check (LDPC) codes with respect to their unequal error protection (UEP) capabilities. We show that the choice of code construction algorithm highly affects the performance and UEP properties of LDPC codes with identical degree distributions. Our results provide an explanation to disagreements in earlier research.

[1]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[2]  Richard D. Wesel,et al.  Selective avoidance of cycles in irregular LDPC code construction , 2004, IEEE Transactions on Communications.

[3]  Olgica Milenkovic,et al.  On unequal error protection LDPC codes based on Plotkin-type constructions , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

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

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

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

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

[8]  Nazanin Rahnavard,et al.  Unequal Error Protection Using Partially Regular LDPC Codes , 2007, IEEE Transactions on Communications.

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

[10]  Kenta Kasai,et al.  Detailedly Represented Irregular Low-Density Parity-Check Codes , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[11]  Evangelos Eleftheriou,et al.  Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

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

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

[15]  David Declercq,et al.  Check-Irregular LDPC Codes for Unequal Error Protection under Iterative Decoding , 2006 .

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

[17]  Dejan Vukobratovic,et al.  Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design , 2008, IEEE Communications Letters.

[18]  David Declercq,et al.  Enhancement of Unequal Error Protection Properties of LDPC Codes , 2007, EURASIP J. Wirel. Commun. Netw..