.png){kind=icon}
Return
A Novel Iterative Reliability-Based Majority-Logic Decoder for NB-LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2019.2938562.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Non-binary low-density parity-check (NB-LDPC) codes usually exhibit much better performance than their binary counterparts. Among NB-LDPC decoding algorithms, the iterative reliability-based majority-logic decoding (MLGD) algorithms are attractive for their low computation complexity, at the cost of performance degradation. In this brief, based on the improved iterative soft reliability-based (IISRB)-MLGD algorithm, we propose a clipped-modified (CM)-IISRB algorithm, which achieves better decoding performance with lower computational complexity. First, two modifications are introduced to the IISRB algorithm, which considerably reduces the decoding complexity with negligible performance loss. Second, an unsaturated-clipping method that facilitates significant performance improvement is presented. Simulation results show that the new algorithm outperforms the IISRB by about 0.2dB for the 256-ary (255, 175) example code. Moreover, based on a new storage reduction method, an optimized architecture is developed for the CM-IISRB algorithm. Synthesis results demonstrate that the proposed decoder can achieve very low hardware complexity, comparable to that of the iterative hard reliability-based (IHRB) decoder.
Keywords:
Iterative decoding
Reliability
Complexity theory
Decoding
Iterative algorithms
Nickel
Circuits and systems
Low-density parity-check codes
non-binary
iterative majority-logic decoding
VLSI
low complexity
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W
Organization
Cited Papers
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave no more
no more