Decoding of short non-binary LDPC codes using a non iterative decoding algorithm

In this paper, we investigate the decoding of short Non-Binary (NB)-LDPC codes of rate 1/2 using a non-iterative approach based on the Maximum-Likelihood (ML) principle. The traditional decoding algorithms used to decode the NB-LDPC codes are by nature iterative where the Variables Nodes (VN) and Check Nodes (CN) exchange data iteratively during, at least, eight iterations which imposes a long decoding time to achieve good performance in terms of Frame Error Rate (FER). In this paper we propose a decoding algorithm based on the Maximum Likelihood (ML) search named Near ML approach where the number of tested words considered as potential codewords is highly reduced. Simulation of codes of lengths 16 and 48 are presented and the results show that the proposed algorithm achieves the performance offered by the EMS algorithm. The NB-LDPC of length 16 is shown to outperform the EMS algorithm.