基于循环差集的LDPC码的快速编码实现

Implementation of Fast Encoding LDPC Codes Based on Cyclic Difference Sets

基于循环差集构造LDPC码在许多文献中都曾提到过,本文通过对循环差集构造LDPC码时关联矩阵的研究,提出一种通过列分割重排可以快速编码的LDPC码的构造方法,进一步节省了存储空间,提高了编译码速率,通过对不同大小的完备循环差集构造的LDPC码的性能仿真,和对LDPC码校验矩阵性质分析得出结论,差集较大的完备循环差集并不适合构造LDPC码,而通过对原始码长较短的完备循环差集构造的LDPC码进行扩展,得到的长码性能均比较优异,为今后利用循环差集构造LDPC码提供参考。

The construction of LDPC codes based on cyclic difference sets have been mentioned in many literature,this paper proposes a new construction method of LDPC codes based on decomposition and rebuilding the rows of the associated matrix,which can further save memory space and raise the speed of encoding and decoding. Simulations of the LDPC codes based on cyclic difference sets of different size and analysis of the check matrix come to the conclusion that it is inappropriate for bigger cyclic difference sets to construct LDPC codes,besides,the long codes constructed by expanding the matrix of short codes are good at decoding. All in all,the whole paper can provide a reference for the construction of LDPC codes based on cyclic difference sets in future.