The simplified difference-domain LDPC decoding algorithm based on RMP-scheduling
Lei Hai · Journal of Sichuan University · 2012
As for the problems of the high complexity of Log-Domain sum-product LDPC decoding algorithm and the slow convergence rate based on SMP scheduling,this paper propose the simplified difference -domain LDPC decoding algorithm based on RMP scheduling.The update of variable-nodes are optimized by RMP scheduling,which can accelerate the convergence rate one time.Due to that the messages pass on the Tanner graph are probability differences and the update of check-nodes are carried out by w minimum absolute values,which can further reduce the complexity of computation.In contrast with decoding algorithm by experiment show that the proposed algorithm can reduce the complexity of computation and accelerate the convergence rate,while it has no obvious loss of decoding performance.