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

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 outperform both t...