.png){kind=icon}
返回
Parallel weighted bit-flipping decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2007.070269.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
belief-propagation (BP)
bit-flipping (BF) decoding
low-density parity-check (LDPC) codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容