论文部分内容阅读
Tanner图最小停止集的大小决定LDPC码在迭代译码时的性能.为此,提出准循环LDPC码无小停止集的充要条件.根据该文所提定理及推论,不仅可以设计出无小停止集的准循环LDPC码,而且还给出了小停止集数目的计算方法.在BER为le-5时,该文设计的准循环LDPC码与随机LDPC码相比具有0.3 dB的增益.该算法可有效评估LDPC码的性能,也可计算LDPC码的短环数,较之现有算法具有更低的计算复杂度.
The size of the minimum stop set in Tanner graph determines the performance of LDPC code in iterative decoding. For this reason, a necessary and sufficient condition for quasi-cyclic LDPC code without stop set is proposed. According to the theorem and inference, Stop quasi-cyclic LDPC codes, but also gives the calculation method of the number of small stop sets.When the BER is le-5, the quasi-cyclic LDPC codes designed in this paper have a gain of 0.3 dB compared with random LDPC codes. The algorithm can effectively evaluate the performance of LDPC codes, and also can calculate the number of short cycles of LDPC codes, which has a lower computational complexity than the existing algorithms.