Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths
Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths
复制标题
DOI：
--
复制
发表时间：
2010-01
期刊：
影响因子：
--
通讯作者：
Guohua Zhang;Xinmei Wang
中科院分区：
文献类型：
--
作者：
Guohua Zhang;Xinmei Wang
提出了一种构造长度大于某一给定数的周长为12 （3,l）的准循环低密度奇偶校验码的方法。这些码的长度可以是形式为LP的任意整数，只要P大于由给定周长为12的码的指数矩阵内的最大元素决定的紧下界。通过将该方法应用于行权为6的情况，我们得到了一个大于2688的任意长度的周长为12（3,6）的QC-LDPC码族，其中包含比O'Sullivan报道的最短周长为12（3,6）的QC-LDPC码短的30个成员码。
A method to construct girth-12 (3,L) quasi-cyclic low-density parity-check (QC-LDPC) codes with all lengths larger than a certain given number is proposed, via a given girth-12 code subjected to some constraints. The lengths of these codes can be arbitrary integers of the form LP, provided that P is larger than a tight lower bound determined by the maximal element within the exponent matrix of the given girth-12 code. By applying the method to the case of row-weight six, we obtained a family of girth-12 (3,6) QC-LDPC codes for arbitrary lengths above 2688, which includes 30 member codes with shorter code lengths compared with the shortest girth-12 (3,6) QC-LDPC codes reported by O'Sullivan.