Generalized construction of quasi-cyclic regular LDPC codes based on permutation matrices

E Gabidulin, A Moinian, B Honary - 2006 IEEE International …, 2006 - ieeexplore.ieee.org
E Gabidulin, A Moinian, B Honary
2006 IEEE International Symposium on Information Theory, 2006ieeexplore.ieee.org
A new approach is proposed for constructing regular low-density parity-check (LDPC) codes
based on tensor product of matrices. In this paper, first a general construction method of
regular LDPC codes exploiting permutation matrices is described. Constructed codes have
a quasi-cyclic structure with no short cycles of length 4 in their Tanner graph, hence simple
encoding while maintaining good performance is achieved. The paper also demonstrates a
generalized design, which covers a large family of LDPC codes and number of other …
A new approach is proposed for constructing regular low-density parity-check (LDPC) codes based on tensor product of matrices. In this paper, first a general construction method of regular LDPC codes exploiting permutation matrices is described. Constructed codes have a quasi-cyclic structure with no short cycles of length 4 in their Tanner graph, hence simple encoding while maintaining good performance is achieved. The paper also demonstrates a generalized design, which covers a large family of LDPC codes and number of other construction methods. The new generalized LDPC codes are defined by a small number of parameters and cover a large set of code lengths and rates. Using these codes, LDPC matrices of any column weight and row weight can be constructed. Performance of these codes under iterative decoding compares well with other well-structured as well as random LDPC codes
ieeexplore.ieee.org
Showing the best result for this search. See all results