LDPC译码复杂度的优化

In this paper, we mainly studying the decoding algorithm complexity of LDPC (Low Density Parity Check Code). Researchers found that LDPC have a very good decoding performance. Accompanied by a random calculation idea generation, researchers pay more attention to iterative stochastic decoding of LDPC. Through theoretical study and simulation analysis for LDPC stochastic decoding mode, found that decoding cycles tend to be set to a higher value. The checksum of most decoding process will stay stability earlier, the rest of decoding cycle will no longer have any meaning. Based on this, the paper proposed to the earlier stop criterion to improve decoding performance, and verifying its effectiveness through simulation experiments.