Structured LDPC codes from permutation matrices free of small trapping sets

This paper introduces a class of structured low-density parity-check (LDPC) codes whose parity check matrices are arrays of permutation matrices. The permutation matrices are obtained from Latin squares and form a finite field under some matrix operations. They are chosen so that the Tanner graphs do not contain subgraphs harmful to iterative decoding algorithms. The construction of column-weight-three codes is presented. Although the codes are optimized for the Gallager A/B algorithm over the binary symmetric channel (BSC), their error performance is very good on the additive white Gaussian noise channel (AWGNC) as well.

[1]  J. Yedidia,et al.  Construction of high-girth QC-LDPC codes , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[2]  Charles J. Colbourn,et al.  Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications) , 2006 .

[3]  Navin Kashyap,et al.  Shortened Array Codes of Large Girth , 2005, IEEE Transactions on Information Theory.

[4]  Sunghwan Kim,et al.  Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$ , 2007, IEEE Transactions on Information Theory.

[5]  Bane V. Vasic,et al.  Combinatorial constructions of low-density parity-check codes for iterative decoding , 2002, IEEE Transactions on Information Theory.

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

[7]  Shu Lin,et al.  A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols , 2003, IEEE Communications Letters.

[8]  R. M. Tanner,et al.  A Class of Group-Structured LDPC Codes , 2001 .

[9]  Shashi Kiran Chilappagari,et al.  Instanton-based techniques for analysis and reduction of error floors of LDPC codes , 2009, IEEE Journal on Selected Areas in Communications.

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

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

[12]  Shu Lin,et al.  Near-Shannon-limit quasi-cyclic low-density parity-check codes , 2004, IEEE Trans. Commun..

[13]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[14]  Bane V. Vasic,et al.  High-rate girth-eight low-density parity-check codes on rectangular integer lattices , 2004, IEEE Transactions on Communications.

[15]  Shashi Kiran Chilappagari,et al.  Error Floors of LDPC Codes on the Binary Symmetric Channel , 2006, 2006 IEEE International Conference on Communications.

[16]  Lara Dolecek,et al.  Analysis of Absorbing Sets for Array-Based LDPC Codes , 2007, 2007 IEEE International Conference on Communications.

[17]  B. Vasic,et al.  Trapping set ontology , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[18]  Shu Lin,et al.  Near-Shannon-limit quasi-cyclic low-density parity-check codes , 2003, IEEE Transactions on Communications.

[19]  Bahram Honary,et al.  Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices , 2006, 2006 IEEE International Symposium on Information Theory.

[20]  Shu Lin,et al.  Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.