CAJ | 학술논문

渐进边增长(PEG)算法构造的低密度奇偶校验码(LDPC)在保证局部围长最大时仍有较多数目的短环。针对该问题，提出一种新的准循环LDPC码构造方法。该方法在PEG算法中采用环多项式(PC)标记，利用PC-PEG方法构造的矩阵作为基矩阵，并对其进行准循环扩展，以消除基矩阵中的短环。实验结果表明，该方法构造的 LDPC 码可大幅减少短环的数目。同时由于引入了准循环结构，能降低编码复杂度。
점진변증장(PEG)산법구조적저밀도기우교험마(LDPC)재보증국부위장최대시잉유교다수목적단배。침대해문제，제출일충신적준순배LDPC마구조방법。해방법재PEG산법중채용배다항식(PC)표기，이용PC-PEG방법구조적구진작위기구진，병대기진행준순배확전，이소제기구진중적단배。실험결과표명，해방법구조적 LDPC 마가대폭감소단배적수목。동시유우인입료준순배결구，능강저편마복잡도。
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.