A Construction Method of QC-LDPC Codes without Short Cycles

Abstract

Low-density Parity-check (LDPC) coding is a class of advanced channel coding techniques. To improve the performance of LDPC codes, a simple and effective method to construct QC-LDPC codes without short cycles (cycles of length four and six) is proposed. The approach is especially effective when the parity-check matrix of QC-LDPC codes is composed of circulant permutation matrices. Firstly, we analyze the shapes of the cycles in the exponent matrix, to get the required conditions of no four-cycles and six-cycles. Then we show how to construct the parity-check matrix without four-cycles and six-cycles by filling rows of the exponent matrix with arithmetic sequences. Simulation results show that the proposed codes have better performance than array codes. Though the performance of the proposed codes is not as well as random codes at higher Eb/N0, they can be applied to practical communications because of being encoded in linear time with shift registers.