A Combining Method of Structured LDPC Codes from Affine Permutation Matrices

In this paper we present a class of structured low-density parity-check (LDPC) codes from affine permutation matrices, called the APM-LDPC codes, which are a generalization of quasi-cyclic LDPC codes. We give a necessary and sufficient condition under which an APM-LDPC code has a cycle and introduce a simple method to construct APM-LDPC codes of large length by combining those of small length based on the Chinese remainder theorem. In particular, we show that the girth of APM-LDPC codes obtained in this method is always larger than or equal to those of given APM-LDPC codes

[1]  Kyeongcheol Yang,et al.  A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem , 2005, IEEE Communications Letters.

[2]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

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

[4]  Jon-Lark Kim,et al.  Explicit construction of families of LDPC codes with no 4-cycles , 2004, IEEE Transactions on Information Theory.

[5]  R. Smarandache,et al.  High-rate, short length, (3,3s)-regular LDPC of girth 6 and 8 , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

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

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

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

[10]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

[11]  Robert C. Williamson,et al.  Loop removal from LDPC codes , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[12]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[13]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[14]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.