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

发布时间：2018-01-06 04:24

本文关键词：基于循环差集的LDPC码的快速编码实现　出处：《中国电子科学研究院学报》2017年05期 　论文类型：期刊论文

【摘要】：基于循环差集构造LDPC码在许多文献中都曾提到过,本文通过对循环差集构造LDPC码时关联矩阵的研究,提出一种通过列分割重排可以快速编码的LDPC码的构造方法,进一步节省了存储空间,提高了编译码速率,通过对不同大小的完备循环差集构造的LDPC码的性能仿真,和对LDPC码校验矩阵性质分析得出结论,差集较大的完备循环差集并不适合构造LDPC码,而通过对原始码长较短的完备循环差集构造的LDPC码进行扩展,得到的长码性能均比较优异,为今后利用循环差集构造LDPC码提供参考。
[Abstract]:The construction of LDPC codes based on cyclic difference sets has been mentioned in many literatures. In this paper, we study the correlation matrix when constructing LDPC codes based on cyclic difference sets. This paper presents a method of constructing LDPC codes which can be encoded quickly by column segmentation and rearrangement, which further saves storage space and improves the coding and decoding rate. By simulating the performance of LDPC codes with different sizes of complete cyclic difference sets, and analyzing the properties of LDPC code check matrix, the conclusion is drawn. The complete cyclic difference sets with large difference sets are not suitable for constructing LDPC codes, but by extending the LDPC codes constructed by the complete cyclic difference sets with short original code length, the performance of the long codes obtained is excellent. It provides a reference for the construction of LDPC codes by using cyclic difference sets in the future.
【作者单位】：海军航空大学;
【基金】：国家自然科学基金(61671463)
【分类号】：TN911.22
【正文快照】： 0引言低密度奇偶校验码(Low-Density Parity-Check,LDPC码)因其接近香农极限的译码性能,成为近年来信道编码研究的热点。LDPC码是Gallag-er博士在1962年提出的,但由于当时的条件所限,并没有引起人们足够的关注,在沉寂了几十年后,由Mackay和Neal证明了其在BP译码算法下,可以达

【相似文献】