电子科技大学学报2016，Vol.45Issue(2)：191-196,6.DOI:10.3969/j.issn.1001-0548.2016.03.006
LDPC码稀疏校验矩阵的重建方法
A Method of Restructuring LDPC Parity-Check Matrix
摘要
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.关键词
信道编码识别/LDPC识别/校验矩阵/稀疏化Key words
channel coding recognition/LDPC recognition/parity-check matrix/sparse分类
信息技术与安全科学引用本文复制引用
包昕,周磊砢,何可,游凌..LDPC码稀疏校验矩阵的重建方法[J].电子科技大学学报,2016,45(2):191-196,6.基金项目
国家自然科学基金(61172140) （61172140）
