Reliability-based iterative proportionality-logic decoding of LDPC codes with adaptive decision

Reliability-based iterative proportionality-logic decoding of LDPC codes with adaptive decision
复制标题

DOI:
10.1109/jcn.2015.000042
复制
发表时间:
2015-07
影响因子:
3.6
通讯作者:
Youming Sun;H. Chen;Xiangcheng Li;Lingshan Luo;Tuanfa Qin
Youming Sun;H. Chen;Xiangcheng Li;Lingshan Luo;Tuanfa Qin
中科院分区:
计算机科学3区
文献类型:
--
作者:
Youming Sun;H. Chen;Xiangcheng Li;Lingshan Luo;Tuanfa Qin

文献摘要

被引文献

相似文献

本文针对两类结构化低密度奇偶校验(LDPC)码,提出了一种基于可靠性的迭代比例逻辑译码算法。本文的主要贡献包括:1)在变量节点和校验节点之间采用伴随式消息代替外部消息进行处理和交换,降低了译码复杂度; 2)提出了一种更加灵活的判决机制,在迭代过程中可以自调整判决门限。这种判决机制对多数逻辑可译码码的译码特别有效; 3)该算法只涉及部分满足预先设计准则的变量节点,具有比例逻辑意义,进一步降低了计算复杂度。仿真结果表明,结合因子校正技术和适当的比例参数,该算法具有良好的性能,在保持较低译码复杂度的同时,能获得较快的译码收敛速度,特别是在小量化级别(3-4比特)时。所提出的算法提供了一个候选人的应用场景中的内存负载和能量消耗是非常有限的。
In this paper, we present a reliability-based iterative proportionality-logic decoding algorithm for two classes of structured low-density parity-check (LDPC) codes. The main contributions of this paper include: 1) Syndrome messages instead of extrinsic messages are processed and exchanged between variable nodes and check nodes, which can reduce the decoding complexity; 2) a more flexible decision mechanism is developed in which the decision threshold can be self-adjusted during the iterative process. Such decision mechanism is particularly effective for decoding the majority-logic decodable codes; 3) only part of the variable nodes satisfying the pre-designed criterion are involved for the presented algorithm, which is in the proportionality-logic sense and can further reduce the computational complexity. Simulation results show that, when combined with factor correction techniques and appropriate proportionality parameter, the presented algorithm performs well and can achieve fast decoding convergence rate while maintaining relative low decoding complexity, especially for small quantized levels (3-4 bits). The presented algorithm provides a candidate for those application scenarios where the memory load and the energy consumption are extremely constrained.