.png){kind=icon}
返回
Parallel Symbol-Flipping Decoding for Non-Binary LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2013.051313.130303.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new low-complexity parallel symbol-flipping decoding algorithm for non-binary low-density parity-check (NB-LDPC) codes is proposed. The algorithm outperforms quite a number of existing reliability-based message-passing algorithms, and its computation complexity is smaller than that of almost all the previously proposed iterative decoding algorithms for NB-LDPC codes. It is suitable for decoding NB-LDPC codes whose parity-check matrices have large column weights.
Keyword:
Non-binary low-density parity-check (LDPC) codes
parallel symbol-flipping decoding
reliability-based message-passing algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach
PREAI
分享收藏
查看更多内容