Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions
IEEE Transactions on Communications
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Low-complexity reliability-based message-passing decoder architectures for non-binary LDPC codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hi-index | 0.00 |
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.