Two reliability-based iterative majority-logic decoding algorithms for LDPC codes
Two reliability-based iterative majority-logic decoding algorithms for LDPC codes
复制标题
DOI：
10.1109/tcomm.2009.12.080493
复制
发表时间：
2009-12
影响因子：
8.3
通讯作者：
Qin Huang;Jingyu Kang;Li Zhang;Shu Lin;K. Abdel-Ghaffar
中科院分区：
文献类型：
--
作者：
Qin Huang;Jingyu Kang;Li Zhang;Shu Lin;K. Abdel-Ghaffar
本文提出了两种新的基于可靠性的LDPC码迭代大数逻辑译码算法。这两种算法都是二进制消息传递算法，只需要逻辑运算和整数加法。因此，它们可以用简单的组合逻辑电路来实现。它们在误码性能上优于或与现有的加权比特翻转或其他基于可靠性的LDPC码迭代译码算法一样好，具有更快的译码收敛速度和更低的译码复杂度。与LDPC码的和积算法相比，它们在性能和译码复杂度之间提供了有效的折衷。
This paper presents two novel reliability-based iterative majority-logic decoding algorithms for LDPC codes. Both algorithms are binary message-passing algorithms and require only logical operations and integer additions. Consequently, they can be implemented with simple combinational logic circuits. They either outperform or perform just as well as the existing weighted bit-flipping or other reliability-based iterative decoding algorithms for LDPC codes in error performance with a faster rate of decoding convergence and less decoding complexity. Compared to the sum-product algorithm for LDPC codes, they offer effective trade-offs between performance and decoding complexity.