一种快捷的LDPC码编码方法

LDPC码作为一种性能优异的纠错码，已经越来越引起通信领域的研究兴趣。而LDPC码性能的优劣，与其二分图中是否存在短长度的圈有关，也即与其奇偶校验矩阵的构造有关。本文在扩展比特填充算法的基础上，设计出一种能够直接编码的奇偶校验矩阵，并在不同码长的情况下进行了仿真，结果表明采用这种设计方法构造的LDPC码随机分布性好，不需要复杂的矩阵求逆，从而对LDPC码的实际应用具有重要参考价值。

Quick and Direct Encoding of Low-Density Parity-Check Codes

LDPC code is a good error correct code which interests telecommunication field recently.However,the performance of LDPC code depends on the girth of its bipartite graph,that is it depends on its sparse parity-check matrices H,especially the complexity of encoding with H.This paper is mainly on how to construct a good matrix H.Based on the extended bit filling algorithm,the paper proposes a new method to construct matrix H which can be encoded directly and quickly.In different length of code,the simulation results show that this quick encoding has good random distribution and it doesn't need to compute the inverse of H and admits linear time encoding.So it can contribute to the LDPC code's application.