Skip to Main Content
In this paper, a new method based on Sum Product algorithm (SPA) using stopping node to reduce computing complexity on Low Density Parity Check Codes (LDPC) decoding algorithms is presented. We show how to make early decisions to reduce calculation of the next iteration. Simulation results show that performance of iterative decoding for LDPC codes using stopping node algorithm can reduce up to 10 times computational complexity with maintaining quality level.
Date of Conference: 25-28 Sept. 2011