|
|
|
| Girth-8 (3,L)-Regular QC-LDPC Codes Based on Novel Deterministic Design Technique |
| Zhang Guo-hua; Chen Chao; Yang Yang; Wang Xin-mei |
| State Kay Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China |
|
|
|
|
Abstract 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.
|
|
Received: 03 June 2009
|
|
|
|
Corresponding Authors:
Zhang Guo-hua
|
|
|
|
|
|
|
2010, Vol. 32 
