Construction of Quasi-Cyclic LDPC codes with large girth based on circulant permutation matirx
Peng Yang, Xiaoxiao Bao, Hui Zhao · 2013
In this paper, we propose an algorithm for removing short-cycles in Quasi-Cyclic (QC) Low-density parity-check (LDPC) codes. First using an algorithm with lower computational complexity, all the cycles in the parity check matrix H are found. Then following a ruler, we adjust the shift value of circulant permutation matrix (CPM) to remove the short-cycles. This algorithm could ensure that the code after cycle removal process preserves the quasi-cyclic structure. Simulation results show that: comparing with the codes (504,252) and (1008, 504), we achieve 0.1dB improvement both.