.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Hard information
LDPC decoding
majoritylogic decoding
nonbinary LDPC codes
reliability-based
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
View more organizations
Cited Papers
.png){kind=icon}
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave View more