Convergence analysis for LDPC serial decoding
Lei Jing · Journal of Chongqing University of Posts and Telecommunications · 2006
Tanner graph of LDPC and flooding decoding algorithm are briefly introduced.On this condition,present serial decoding algorithm and semi-serial decoding algorithm which based on check nodes.By analysing DE(Density Evolution) and tree depth of message convergence,it's proved that the message convergence speed grows about twice as fast in the serial decoding algorithm compared to the flooding decoding algorithm,and reduce the decoding complexity.Respectively apply flooding decoding algorithm and serial decoding algorithm to simulate over AWGN channel.Theory and results of simulation show that the decoding performance could be improved by serial decoding algorithm.