基于仿射置换矩阵的LDPC码

Low Density Parity-check Codes based on Affine Permutation Matrix

由于一定条件下可以接近或达到香农极限的特性,低密度奇偶校验(LDPC)码成为下一代通信系统的标准编码,正得到越来越广泛的应用。其中准循环(QC) LDPC码比其他LDPC码在编译码方面更易于硬件实现,成为该领域的研究热点。然而传统QC-LDPC码的校验矩阵围长很难超过12,影响了其译码效率与性能。本文介绍一种基于仿射置换矩阵的LDPC码,可以构造出的LDPC码校验矩阵的围长更大,在码长和码率选择上更加灵活,从而获得更加优异的性能。

Low Density Parity-Check( LDPC) codes are chosen to be the standard codes for the communication systems of the next generation due to its characteristics of the ability to approach or even reach the Shannon Limit under certain conditions,and are used more and more widely. Quasi-cyclic( QC) LDPC codes have advantages over other types of LDPC codes in hardware implementations of encoding and decoding. Therefore,they become hotspots in this field. However,the girth of the conventional QC-LDPC codes is upper-bounded by 12 which lowers its decoding efficiency and performance.In this paper,a class of LDPC codes based on affine permutation matrices can achieve a larger girth and be more flexible in code length and bit rate selection,thus more excellent performance can be obtained.