%0 Journal Article
%T Girth-8 (3,L)-Regular QC-LDPC Codes Based on Novel Deterministic Design Technique
Girth-8 (3,L)-规则QC-LDPC码的一种确定性构造方法
%A Zhang Guo-hua
%A Chen Chao
%A Yang Yang
%A Wang Xin-mei
%A
张国华
%A 陈 超
%A 杨 洋
%A 王新梅
%J 电子与信息学报
%D 2010
%I
%X 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.
%K Low-Density Parity-Check (LDPC) code
%K Quasi-Cyclic (QC)
%K Girth
低密度奇偶校验码
%K 准循环
%K 围长
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=59482E79A1103A36267DFAF445F74911&yid=140ECF96957D60B2&vid=9971A5E270697F23&iid=94C357A881DFC066&sid=A3A7F1D1E8071003&eid=59B00AA7F83CF649&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=13