Low Complexity Early Stopping Criterion for Weighted Bit Flipping Decodings of LDPC Codes

Recently, extensive researches have been focused on the early stoping criterion for Belief-Propagation(BP) decoding of LDPC codes. However, there is little study on suitable design of early stopping criterion for Weighted Bit Flipping (WBF) decodings. Based on the whole novel understanding of WBF algorithm, this paper study presents a low complexity and high adaptable stopping criterion which detects most of the undecodable blocks in an early stage of the decoding process. The simulation results show that the proposed method can significatly reduce the average number of required iterations with negligible performance loss, which is able to achieve appealing tradeoff between the complexity and the performance.