Improved Min-Sum-Plus-Correction-Factor Algorithm using stopping node for LDPC decoding

Low-Density-Parity-Check Code (LDPC) codes have received great attention recently because of the excellent error-correcting capability and optional error correct code. A new method base on Min-Sum-Plus-Correction-Factor Algorithm using stopping node to reduce computing complexity on Low-Density-Parity-Check Code decoding algorithm is presented in this paper. The improved method shows how to make early decisions to reduce computation complexity of LDPC decoding algorithm in the next iteration under QPSK systems. Simulation results show that computational complexity of LDPC decoding using Stopping node criterion can reduce up to 6 times with maintaining quality level.