Construction of quasi-cyclic LDPC codes from quadratic congruences
Chun-Ming Huang, Jen-Fa Huang, Chao-Chin Yang · IEEE Communications Letters · 2008
In this paper, we proposed a novel method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices via a simple quadratic congruential equation. The main advantage is that QC-LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC-LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths and have almost the same performance as Sridara-Fuja-Tanner codes.