Girth-8 (3,L)-Regular QC-LDPC Codes Based on Novel Deterministic Design Technique
Girth-8 (3,L)-规则QC-LDPC码的一种确定性构造方法

Most of the proposed constructions for Low-Density Parity-Check (LDPC) codes with girth at least eight are focused on (semi-) stochastic methods with the aid of computer search. Motivated by the resulting parity-check matrices obtained from the Greedy construction idea, a deterministic method is presented to construct a novel family of girth-8 (3,L)-regular Quasi-Cyclic (QC-) LDPC codes. The parity-check matrix of the new code consists of 3×L P×P cyclic permutation matrices and the girth of its Tanner graph is eight for arbitrary integer P≥3L2/4.