Parallel Weighted Bit-Flipping Decoding
Parallel Weighted Bit-Flipping Decoding
复制标题
DOI：
10.1109/lcomm.2007.070269
复制
发表时间：
2007-08
期刊：
影响因子：
--
通讯作者：
Xiaofu Wu;Chunming Zhao;X. You
中科院分区：
文献类型：
--
作者：
Xiaofu Wu;Chunming Zhao;X. You
提出了一种用于低密度奇偶校验码的并行加权比特翻转译码算法。与最著名的串行加权比特翻转解码相比，PWBF解码的收敛速度明显更快，但性能损失很小。对于有限几何LDPC码的译码，我们通过实例证明了所提出的PWBF译码在5次迭代左右收敛，性能非常接近标准的信念传播译码。
A parallel weighted bit-flipping (PWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known serial weighted bit-flipping decoding, the PWBF decoding converges significantly faster but with little performance penalty. For decoding of finite-geometry LDPC codes, we demonstrate through examples that the proposed PWBF decoding converges in about 5 iterations with performance very close to that of the standard belief-propagation decoding.