Comparison between Different Decoding Algorithms For Low Density Parity Check

Forward error correction code with Low Density Parity Check (LDPC) gives substantial results very close to Shannon limit. This can be achieved when complexity and delay time is unlimited. Thus, it is significant to recognize the limitation of those parameters in the decoding of LDPC. In this research, a study of LDPC performance with three decoding algorithms namely; bit-flipping, log domain, and prob domain are presented. The first one is related to hard decision family while the last two types are the soft decision that follows the sum-product algorithm. A simulation model of a wireless communication system included LDPC are evaluated with the motioned three types of decoding using Matlab Package, version 2018a. The results show that the log domain and prob domain are outperforming the bit-flipping algorithm by a significant amount of Signal to Noise Ratio (SNR). Finally, optimum values of LDPC parameters are chosen according to the achieved results that will give better results are presented.