期刊文献+

一种基于环路分类和启发式搜索的大围长QC-LDPC码构造新方法 被引量:2

New Construction of Large-girth QC-LDPC Codes by Classification of Cycles and Heuristic Search Strategy
下载PDF
导出
摘要 文章通过对QC-LDPC码校验矩阵中的环路进行分类,提出一种检测所有长度小于12的环的无重无漏方法。利用该环路检测方法,提出了一种新的基于启发搜索的大围长QC-LDPC码构造法。该构造法分3步:首先,在无穷大CPM尺寸条件下根据启发策略搜索2条满足围长约束的整数序列;然后,依据设计码率从2条序列中截取若干整数对构成一个移位矩阵;最后,利用最近Zhang提出的理论下界从该移位矩阵中精确计算出使围长不减的CPM尺寸连续取值区间。与Liu-Han方法相比,新方法有2个优点:(1)既可以构造CPM尺寸连续变化的girth-10+QC-LDPC码,也可以构造CPM尺寸连续变化的girth-12 QC-LDPC码;(2)由于新环路检测方法有效提高了序列搜索速度,因此可以构造出设计码率非常高的girth-10+和girth-12 QC-LDPC码。 By classifying cycle types within the parity-check matrix of a quasi-cyclic (QC) low-density parity-check (LDPC) code, a method without repetition or omission is proposed to detect all the cycles with lengths smaller than twelve. Based on this cycle detection method, a new approach is presented to construct large girth QC-LDPC codes by using some heuristic strategies. The approach includes three steps. Firstly, under the infinite cyclic permutation matrix (CPM) size con- dition, two integer sequences satisfying the girth constraint are found using a heuristic strategy. Secondly, according to the de- signed code rate, several integer pairs are extracted from the two sequences so as to form a shift matrix. Finally, by employing the recently proposed theoretical lower bound by Zhang et. al, a range of consecutive CPM sizes in which the girth never de- crease is accurately computed from the shift matrix. Compared with Liu-Han's method, the new approach possesses two ad- vantages in the sense that: (1) Not only girth-10 + QC-LDPC codes but also girth-12 ones can be constructed to have consecutive CPM sizes;(2) girth-10 + and girth-12 QC-LDPC codes can be generated with very high code rates, due to the new cycle detection method which significantly accelerates the sequence search procedure.
出处 《空间电子技术》 2013年第2期79-84,89,共7页 Space Electronic Technology
关键词 低密度奇偶校验码 准循环 围长 LDPC codes Quasi-cyclic Cycle Girth
  • 相关文献

参考文献19

  • 1Fossorier M P C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices [ J ]. IEEE Trans. Inf. Theory ,2004,50 ( 8 ) : 1788 - 1793.
  • 2Vasic B, Pedagani K, Ivkovic M. High-rate girth-eight low- density parity-check codes on rectangular integer lattices [J]. IEEE Trans. on Commun. ,2004,52 (8):1248 1252.
  • 3O Sullivan. ME. Algebraic construction of sparse matrices with large girth [ J ]. IEEE Trans. Inform. Theory, 2006,52 (2) :718 -727.
  • 4Milenkovic O, Kashyap N, Leyba D. Shortened array codes of large girth [ J ]. IEEE Trans. Inf. Theory,2006,52 ( 8 ) : 3707 - 3722.
  • 5Tao X, Kim J, Liu W, et al. Improved construction of low- density parity-check codes based on lattices [ C ]. 2007 International Symposium on Information Technology Con- vergence,2007 : 208 - 212.
  • 6Wang Y, Yedidia J-S, Draper S-C. Construction of high- girth QC-LDPC codes [ C ]. 5th International Symposium on Turbo Codes and Related Topics,2008,180 -185.
  • 7Wu X F, You X H, Zhao C M. A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes [ J ]. IEEE Trans. Commun. , 2008,56 (6) : 854 857.
  • 8张伟,朱光喜,彭立,沈琼霞.大围长结构化LDPC码构造方法[J].计算机科学,2009,36(11):109-112. 被引量:2
  • 9刘磊,周武旸.码长连续变化的QC-LDPC码的设计[J].电子与信息学报,2009,31(10):2523-2526. 被引量:6
  • 10韩辉,刘磊,詹磊,周武旸.一种码率码长灵活变化的QC-LDPC码[J].无线通信技术,2009,28(4):1-4. 被引量:3

二级参考文献103

共引文献30

同被引文献10

  • 1Liu K, Fei Z, Kuang J. Novel algebraic constructions of nonbinary structured LDPC codes over finite fields [ C ]. in 68th IEEE VTC-Fall,2008:1-5.
  • 2Myung S. Yang K, A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem [ J ]. IEEE Commun. Lett. ,2005,9(9): 823-825.
  • 3Zhang J-W, Li C-X, Bao J-R. A construction method of QC-LDPC codes without short cycles C ]. 4th internation- al conference on multimedia information networking and security. 2012,138-141.
  • 4Zhang G, Sun R, Wang X. Construction of girth-eight QC- LDPC codes from greatest common divisor [ J ]. IEEE Commun. Lett. ,2013,17 (2) :369-372.
  • 5Fossorier M P C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices [ J ]. IEEE Trans. Inf. Theory,2004,50(8) : 1788-1793.
  • 6Wu X F, You X H, Zhao C M. A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes [ J 1- IEEE Trans. Commun. , 2008,56 ( 6 ) : 854- 867.
  • 7Vasie B, Pedagani K Ivkovic M. High-rate girth-eight mow- density parity-check codes on rectangular integer lattices [ J ]. IEEE Trans. Commun. , 2004,52 ( 8 ) : 1248-1252.
  • 8Zhang G, Sun R, Wang X. New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences [ C ]. in Proe. International Symp. Turbo Codes Iterative Inf. Process,2012:31-35.
  • 9ZHANG GuoHua,WANG JuHua,LI XueYuan,WANG XinMei.Tight lower bound of consecutive lengths for QC-LDPC codes with girth at least ten[J].Chinese Science Bulletin,2011,56(12):1272-1277. 被引量:3
  • 10张国华,刘智娟,王鸣涛.一类girth-8QC-LDPC码构造方法的简化和扩展[J].空间电子技术,2015,12(4):30-34. 被引量:2

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部