.png){kind=icon}
返回
Multiple-Votes Parallel Symbol-Flipping Decoding Algorithm for Non-Binary LDPC Codes
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2015.2418260.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A novel decoding algorithm for non-binary low density parity check (NB-LDPC) codes is proposed. The algorithm builds on the recently designed parallel symbol-flipping decoding (PSFD) algorithm and combines a technique of error estimation and a method of multiple voting levels from each unsatisfied check-sum to the corresponding variable nodes. Simulations results, performed on a number of NB-LDPC codes of various lengths and column weights constructed using several methods, show that the new algorithm not only avoids using code-dependent voting threshold but also improves the error rate performance of the PSFD algorithm, particularly for low column weight parity-check matrices.
Keyword:
NB-LDPC codes
low complexity decoding algorithm
symbol flipping
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
分享收藏
查看更多内容