.png){kind=icon}
Return
A Low Complexity Decoding Algorithm for Majority-Logic Decodable Nonbinary LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2010.100810.101403.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we propose a low complexity decoding algorithm for majority-logic decodable nonbinary low-density parity-check (LDPC) codes. The proposed algorithm is initialized with the quantized squared Euclidean distances between the constellation points and the received signals. Like most of the existing reliability-based decoding algorithms, the proposed algorithm requires only integer operations and finite field operations and (hence) can be implemented with simple combinational logic circuits in practical systems. Simulation results show that the proposed algorithm suffers from a little performance degradation compared with FFT-QSPA. The algorithm provides a candidate for trade-offs between performance and complexity.
Keywords:
Low complexity decoding
majority-logic decodable
nonbinary LDPC codes
FFT-QSPA
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSave
ShareSaveShareSave
View more