一种新的基于变量节点信息的LDPC提前终止准则

In this paper, a new simple early stopping criterion (SC) is proposed to reduce the number of decoding iterations for low density parity check (LDPC) codes. This criterion is based on the variations of the number of unreliable variable nodes in the decoding iteration with low computational complexity. It can also dramatically reduce the number of hard decision for parity-check equations. Simulation shows that our proposed stopping criterion reduces the average number of iterations (ANI) and the average number of testing parity-check equations (ANT) greatly with negligible degradation in bit error rate (BER) performance over a wide signal-to-noise (SNR) region.