Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
复制标题
DOI：
10.1109/26.768759
复制
发表时间：
1999-05-01
影响因子：
8.3
通讯作者：
Imai, H
中科院分区：
文献类型：
--
作者：
Fossorier, MPC;Mihaljevic, M;Imai, H
针对加性高斯白噪声信道上低密度奇偶校验码的快速迭代译码，提出了两种简化的信念传播算法。这两个版本都只使用实加法实现，这大大简化了需要计算概率乘积的信念传播的解码复杂度。此外，这两种算法不需要任何关于信道特性的知识。这两种算法都产生了良好的性能复杂性权衡，并且可以在软件和硬件中有效地实现，并且可能量化接收值。
In this paper, two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two algorithms do not require any knowledge about the channel characteristics. Both algorithms yield a good performance-complexity tradeoff and can be efficiently implemented in software as well as in hardware, with possibly quantized received values.