.png){kind=icon}
返回
Hard-Information Bit-Reliability Based Decoding Algorithm for Majority-Logic Decodable Nonbinary LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2016.2537812.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A modified bit-reliability based decoding algorithm is presented based on a recent work by Huang et al. For the presented algorithm, only one Galois field element is passed and exchanged along the edges of the Tanner graph. At variable nodes, full messages rather than extrinsic messages are processed to further reduce the computational complexity. At check nodes, only hard reliability is considered and the main operation is to compute the check-sum and send one extrinsic symbol back to variable nodes. Simulation results show that, even with lower complexity and less memory consumption, the presented algorithm still can perform very closely to the original wBRB algorithm with low quantization bits (3 similar to 4 bits) when decoding the majority-logic decodable nonbinary LDPC codes. For codes constructed in high order fields, the presented algorithm can even outperform the original wBRB algorithm.
Keyword:
Hard information
LDPC decoding
majoritylogic decoding
nonbinary LDPC codes
reliability-based
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
分享收藏
分享收藏
查看更多内容