Modified Min Sum Decoding Algorithm for Low Density Parity Check Codes

• Published in: Procedia computer science Vol. 171; pp. 2128 - 2136
• Main Authors: Shrinidhi, J, Krishna, P. Sri, B, Yamuna, K., Pargunarajan
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 2020
• Subjects: LDPC; Min Sum decoding algorithm; Sum Product decoding algorithm; Wiener Filter; LDPC; Wiener Filter; Min Sum decoding algorithm; Sum Product decoding algorithm
• ISSN: 1877-0509; 1877-0509
• DOI: 10.1016/j.procs.2020.04.230

The Sum Product Algorithm (SPA) is known to offer the best performance in decoding large block length Low Density Parity Check (LDPC) codes. However, modifications in SPA to decrease the computation complexity have resulted in performance degradation. The Min Sum Algorithm (MSA) is one such variant, where the computation of the check-to-variable message is simplified to a minimum operation, instead of a hyperbolic tan calculation. Several modifications have been proposed in order to recover the performance loss of the MSA with respect to SPA. This paper proposes a modification to the MSA, based on the Wiener and Linear Minimum Mean Square Error (LMMSE) estimators for LDPC codes. The golden section search algorithm has been used to optimize the computations of the parameter estimation. Simulation results with these estimated parameters show that for low values of SNR, the modified algorithm outperforms MSA and provides performance close to that of SPA with a gain of 0.1 dB. For higher values of SNR, it outperforms MSA with a gain of 1.75 dB while providing an acceptable performance degradation with respect to SPA.