A block-PEG construction method for LDPC codes

The construction of low-density parity codes(LDPC) is one of the hottest fields in the research of LDPC codes. In this paper, we propose a quasi-cyclic(QC) construction method of parity-check matrix of LDPC codes, named block-PEG method. In this method, a basic matrix is constructed firstly, then the none-zero elements in the matrix are extended by circulant permutation matrices, and the parity-check matrix is obtained at last. The simulation results indicate that the performances of LDPC codes constructed by block-PEG method are similar with that of PEG algorithm. In linear-time, block-PEG can generate LDPC codes with similar performance of the PEG-generated codes.

[1]  Manabu Hagiwara,et al.  Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices" , 2009, IEEE Trans. Inf. Theory.

[2]  Kyeongcheol Yang,et al.  Quasi-cyclic LDPC codes for fast encoding , 2005, IEEE Transactions on Information Theory.

[3]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

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

[5]  Amir H. Banihashemi,et al.  Lowering the Error Floor of LDPC Codes Using Cyclic Liftings , 2011, IEEE Trans. Inf. Theory.