计算机工程Issue(10)：287-289,293,4.DOI:10.3969/j.issn.1000-3428.2013.10.062
基于PCPEG算法的准循环LDPC码构造
Quasi-cyclic LDPC Codes Construction Based on PCPEG Algorithm
摘要
Abstract
For the problems that the Progressive Edge Growth(PEG) algorithm can achieve large local girth, but ignores the number of shortest cycles, this paper proposes an improved PEG algorithm, which is called PC-PEG algorithm, using Polynomial of Cycle(PC). After a basic matrix is constructed by PCPEG algorithm, circulant permutation matrices will replace the short cycle in the basic matrix. The new method can eliminate effectively the short cycles in the basic matrix without changing the degree distribution fraction of the basic matrix. Experimental results show that the proposed method not only reduces the number of small cycle significantly, but also reduces the coding complexity for its quasi-cyclic structure.关键词
低密度奇偶校验码/渐进边增长算法/准循环结构/短环/循环置换矩阵/基矩阵Key words
Low Density Parity Check(LDPC) codes/Progressive Edge Growth(PEG) algorithm/quasi-cyclic structure/short cycle/circulant permutation matrix/basic matrix分类
信息技术与安全科学引用本文复制引用
刘国繁,陈辉,陈志良..基于PCPEG算法的准循环LDPC码构造[J].计算机工程,2013,(10):287-289,293,4.基金项目
湖南省科技计划基金资助项目(2012SK3173) （2012SK3173）
