Iteration Acceleration in SPA Algorithm for LDPC Codes
Iteration acceleration is the key to improve SPA efficiency.Individual scheduling of variable nodes and check nodes can accelerate iteration,but the computational complexity and control cost cannot be underestimated.Inspired by Gauss iterative method to solve the equation,this paper proposes SPA iteration acceleration algorithm and uses the latest information for each information update.Under the common signal-to-noise ratio,the average number of iterations required by this algorithm is reduced by 43%compared with SPA.The bit error rate of the iteration acceleration algorithm is lower than that of SPA when there is no increase in control overhead and little increase in computational complexity.