Abstract :
Low Density Parity Check (LDPC) codes over a Galois Field GF(q) can provide significantly better error- correcting quality than binary LDPC codes with moderate code length. However, the computational complexity and memory requirement of nonbinary codes are much higher, limiting the application of non- binary LDPC codes. In this paper, we propose an adaptive message truncation algorithm for non-binary LDPC decoding, guided by the estimated code error rates. Compared to the previous fixed message truncation method, it can cut the messages adaptively, and therefore provide better decoding quality and computation complexity reduction. To further reduce the computation, we propose another adaptive check node update algorithm, simplifying the decoding by reducing the number of check nodes updating. Our simulation results demonstrate that by combining these two algorithms together, the average message size can be reduced greatly and good decoding quality is achieved, at a little cost of iterations. Compared to the existing truncation algorithms, our approach can reduce the order of complexity to O(nalog2(na)) (where na is messages size), with less performance degradation.
Keywords :
Galois fields; computational complexity; error correction codes; parity check codes; Galois field; adaptive extended min-sum algorithm; computation complexity reduction; decoding quality; error-correcting quality; low density parity check codes; nonbinary LDPC decoding; Complexity theory; Decoding; Error analysis; Iterative decoding; Peer to peer computing; Signal to noise ratio;