Constructing high-rate scale-free LDPC codes

Low-density parity-check (LDPC) codes with scale-free (SF) symbol-node degree distribution have been shown to provide very good error performance. When the code rate becomes high, however, there will be a lot of degree-2 symbol nodes in the “pure” SF-LDPC codes. As a consequence, when the codes are constructed by connecting the symbol nodes with the check nodes, many small-size cycles will be formed. Such small-cycles will degrade the error performance of the codes. In this paper, we address the issue by imposing a new constraint on the design of high-rate SF-LDPC codes. We will compare the error rates of the constrained SF-LDPC codes and other optimized LDPC codes.

[1]  C. K. Michael Tse,et al.  Application of complex-network theories to the design of short-length low-density-paritycheck codes , 2009, IET Commun..

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

[3]  Claude E. Shannon,et al.  A Mathematical Theory of Communications , 1948 .

[4]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[6]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

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

[8]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[9]  C. K. Michael Tse,et al.  Modeling the Telephone Call Network , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[10]  Liang Chen,et al.  Synchronization of the Time-Varying Discrete Biological Networks , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[11]  Marco Chiani,et al.  Design and performance evaluation of some high-rate irregular low-density parity-check codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[12]  Amir H. Banihashemi,et al.  A heuristic search for good low-density parity-check codes at short block lengths , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[13]  Hui Zheng,et al.  Probability Distribution of Blackouts in Complex Power Networks , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[14]  William E. Ryan,et al.  Design of efficiently encodable moderate-length high-rate irregular LDPC codes , 2004, IEEE Transactions on Communications.

[15]  Paul Erdös,et al.  On random graphs, I , 1959 .

[16]  C. K. Michael Tse,et al.  Complex-Network Modeling of a Call Network , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

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