低误码平底LDPC码的块交织构造算法

Block interleaving algorithm for construction of low error floor LDPC codes

该文针对低密度奇偶校验(low-density parity-check,LDPC)码的误码平底问题,给出了采用基矩阵扩展构造的LDPC码的误码率和最小Hamming距离的估计公式。在此基础上,提出了子矩阵可以叠加的块交织构造算法,改善了LDPC码的最小距离特性。仿真表明,与传统的基矩阵扩展构造算法相比,该文的算法能将LDPC码的误码平底从10-7降低到10-9以下。

A set of formulas were developed describe the probability of the minimum Hamming distance and the relationship between the bit error ratio and the minimum Hamming distance for low-density parity check （LDPC） codes constructed with basic matrix expansion algorithm to analyze the error-floor problem. A block interleaving algorithm was given that permits sub-matrices to be superposed in the same location to construct low-error-floor LDPC codes. Simulation results demonstrate that compared with the basic matrix expansion algorithm, the proposed code construction algorithm alleviates the error-floor of an LDPC code from 10^-7 to 10^-9.