Abstract

In this paper, an early stopping scheme is proposed for low-density parity-check (LDPC) decoders. The proposed scheme predicts that the LDPC decoder will not be able to correct errors and then stops the iterative decoding process before reaching the maximum number of iterations. When the number of parity checks unsatisfied at both the $l-$th and the $(l-T)-$th decoding iterations is larger than a threshold, the decoder with the proposed scheme predicts that the decoding of the codeword is failed at the last iteration. Protograph-based extrinsic information transfer (PEXIT) chart analysis is used to determine the threshold. Simulation results show that the LDPC decoder can correct errors with the lower average number of iterations by using both the conventional syndrome test and proposed scheme.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call