Construction of Quasi-Cyclic LDPC Codes from One-Coincidence Sequences

摘要

In this paper, we proposed a new method for constructing quasi-cyclic low-density parity-check (QC- LDPC) codes based on circulant permutation matrices via the one-coincidence sequences. 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.