低密度奇偶校验码中不同译码算法之间的对比

Compare the Difference of Different LDPC Decoding Algorithms

前向纠错码中的LDPC码给出了非常逼近香农限的结果。当算法复杂度和时延没有限制的时候这种结果可以实现。我们对log域SPA算法和概率域SPA算法进行了比较,通过比较得到在码率相同的情况下,码长的增长会改善算法的性能。概率域SPA算法在性能上优于log域SPA算法,而log域SPA算法的实现复杂度要低于概率域SPA算法。

LDPC codes in forward error correction codes give results that are very close to the Shannon limit. This result can be achieved when there are no constraints on algorithmic complexity and latency. We compared the Log-domain SPA algorithm with the Prob-domain SPA algorithm, and found that under the same code rate, the increase of the code length will improve the performance of the algorithm.The performance of the Prob domain SPA algorithm is better than the Log domain SPA algorithm, and the implementation complexity of the Log domain SPA algorithm is lower than that of the Prob domain SPA algorithm.