Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth

PinYi Ren, Qiang Yuan, Rui Wang, Jun Cai
2011 Science China Information Sciences  
In this paper, a novel method for constructing quasi-cyclic LDPC codes with low complexity is proposed. By choosing each circulant permutation matrix sequentially, the proposed method ensures that the current circulant permutation matrix forms no cycles of length smaller than g with the existent circulant permutation matrices. The construction complexity of the proposed algorithm is much lower than that of the random construction. Simulation results show that the proposed QC-LDPC codes can
more » ... rform both the random regular LDPC codes with short to moderate block lengths, and the proposed construction method LDPC codes based on the finite geometries in terms of bit-error-rate (BER). Keywords quasi-cyclic (QC), LDPC (low-density parity-check) codes, circulant permutation matrix, girth Citation Ren P Y, Yuan Q, Wang R, et al. Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth.
doi:10.1007/s11432-010-4152-0 fatcat:cr47ugcinfdcxc22awr3zttuna