基于环的准循环LDPC码的小停止集计算(英文)

Small Stopping Sets Counting Methods for Quasi-cyclic Low Density Parity Check Codes Based on the Cycle Theory

Tanner图最小停止集的大小决定LDPC码在迭代译码时的性能.为此,提出准循环LDPC码无小停止集的充要条件.根据该文所提定理及推论,不仅可以设计出无小停止集的准循环LDPC码,而且还给出了小停止集数目的计算方法.在BER为le-5时,该文设计的准循环LDPC码与随机LDPC码相比具有0.3 dB的增益.该算法可有效评估LDPC码的性能,也可计算LDPC码的短环数,较之现有算法具有更低的计算复杂度.

It is well known that performance of low-density parity check （LDPC） codes under iterative decoding is determined by the size of the smallest stopping sets in the Tanner graph. To solve this problem, we propose necessary and sufficient conditions of quasi-cyclic LDPC codes without small stopping sets. According to the proposed theorems and corollaries, we can design good QC-LDPC codes without small stopping sets which outperforms random LDPC codes by SNR = 0.3 dB at BER of le-5, and count the number of the small stopping sets. The method can be used effectively to evaluate performance of LDPC codes according to their stopping sets distributions. It can find the number of cycles of LDPC codes which is less complex than existing algorithms.