【摘要】 为了扩展QC-LDPC码的逐步边增加(Progressive edge-growth,PEG)算法,在分析Kronecker积和PEG基本算法的基础上,结合校验矩阵节点的度分布要求,提出了一种QC-LDPC码的Kronecker积-PEG普适算法。该算法通过引入Kronecker积实现基矩阵的构造,同时确定循环移位矩阵,进一步根据变量节点和校验节点的度分布要求完成了QC-LDPC码的设计,分析并证明了该算法的环长至少为girth-8。对算法性能进行了仿真验证,结果表明,该算法在保持QC-LDPC码低密度特征和良好误码性能的同时具有普适性。更多还原

【Abstract】 A universal Progressive Edge Growth(PEG) algorithm with the Kronecker product is proposed for constructing Quasi-Cyclic Low-Density Parity-Check(QC-LDPC) codes.The Kronecker product is introduced for constructing the basic matrix.The check matrix of QC-LDPC codes is designed based on the demand of the node degree distribution.It is proved that the girth of the check matrix is larger than Girth-8.Simulation results indicate that the proposed algorithm performs well to maintain the low density and bite error rate characters of the constructed QC-LDPC coeds.It can be used for the design of regular and irregular QC-LDPC coeds.更多还原