A differential binary message-passing LDPC decoder
A differential binary message-passing LDPC decoder
复制标题
DOI：
10.1109/tcomm.2009.09.070617
复制
发表时间：
2009-09
影响因子：
8.3
通讯作者：
N. Mobini;A. Banihashemi;S. Hemati
中科院分区：
文献类型：
--
作者：
N. Mobini;A. Banihashemi;S. Hemati
在本文中，我们提出了一种用于解码低密度奇偶校验（LDPC）码的二进制消息传递算法。该算法显着提高了纯硬决策迭代算法的性能，同时内存需求和计算复杂度略有增加。我们将可靠性值与代码奇偶校验矩阵的每个非零元素相关联，并根据来自校验节点的外部二进制消息的总和在每次迭代中差异化地修改该值。对于测试的随机和有限几何 LDPC 码，所提出的算法可以在感兴趣的错误率下分别接近大约 1 dB 和 0.5 dB 的置信传播 (BP)。同时，与BP不同的是，该算法不需要估计信道信噪比。低内存和计算要求以及二进制消息传递使得所提出的算法对于高速低功耗应用具有吸引力。
In this paper, we propose a binary message-passing algorithm for decoding low-density parity-check (LDPC) codes. The algorithm substantially improves the performance of purely hard-decision iterative algorithms with a small increase in the memory requirements and the computational complexity. We associate a reliability value to each nonzero element of the code's parity-check matrix, and differentially modify this value in each iteration based on the sum of the extrinsic binary messages from the check nodes. For the tested random and finite-geometry LDPC codes, the proposed algorithm can perform as close as about 1 dB and 0.5 dB to belief propagation (BP) at the error rates of interest, respectively. This is while, unlike BP, the algorithm does not require the estimation of channel signal to noise ratio. Low memory and computational requirements and binary message-passing make the proposed algorithm attractive for high-speed low-power applications.