LDPC码稀疏校验矩阵的重建方法-电子科技大学.PDFVIP

第45 卷 第2 期 电 子 科 技 大 学 学 报 Vol.45 No.2 2016年3月 Journal of University of Electronic Science and Technology of China Mar. 2016 LDPC码稀疏校验矩阵的重建方法 包 昕，周磊砢，何 可，游 凌 (西南电子电信技术研究所 成都 610041) 【摘要】针对LDPC码识别过程中的稀疏校验矩阵重建问题，研究并提出了3种算法。在分析和比较LDPC码与一般分组码 识别模型的基础上，将LDPC码的识别问题定义为寻找码字对偶空间下某组稀疏基的数学问题。通过以校验向量行重作为优化 对象，先后设计和实现了了2- 阶行间线性变换、p -阶行间线性变换、线性关系有限穷举的3种矩阵稀疏化算法，力求实现无误 码条件下对适度码长长度LDPC码校验矩阵的有效重建。测试结果表明，该算法适用于包括802.16e 、802.11n 、DVB-S2 、 GJB7296 、GB20600在内的多种LDPC码标准。 关 键 词 信道编码识别; LDPC识别; 校验矩阵; 稀疏化 中图分类号 TN911.22 文献标志码 A doi:10.3969/j.issn.1001-0548.2016.03.006 A Method of Restructuring LDPC Parity-Check Matrix BAO Xin, ZHOU Lei-ke, HE Ke, and YOU Ling (Southwest Electronics and Telecommunication Technology Research Institute Chengdu 610041) Abstract To solve the problem of restructuring sparse parity-check matrix in low-density parity-check (LDPC) recognition processing, three algorithms are proposed. Through analyzing and comparing the LDPC recognition model with the tradition coding recognition models, the former one is defined as a problem of finding a group sparse-base which spans the dual-space of the coding. Then, by making the weight of check-vector as the optimized object, the 2-order linear transformation algorithm, p -order linear transformation algorithm, and linear relationship exhaustive searching algorithm are proposed to restructure sparse parity-check matrix of a LDPC code with suitable code length in an error free environment. The result of simulations show that these algorithms fit most of LDPC standards, including 802.16e, 802.11n, DVB-S2, GJB7296, GB20600 and so on. Key words channel coding recognition; LDPC recognition; parity-check matr