Research of dynamic LDPC decoding algorithm in CMMB
Sheng Yi Wu · Journal of Circuits and Systems · 2010
The traditional Belief-Propagation algorithm and Layered Belief-Propagation algorithm of low-density parity-check codes can’t converge fast because of the random updating order of the check nodes. This paper discusses a dynamic decoding algorithm in detail, which updates the nodes with low reliability first. Compared with the static hierarchical algorithm, the simulations, which are made in the terms of the standard of CMMB, show that dynamic algorithm significantly improves the convergence rate of decoding and its average iteration number can be reduced to 50%. Finally, complexity is also addressed.