A Low-Complexity Stopping Criterion for Iterative Turbo Decoding

This letter proposes an efficient and simple stopping criterion for turbo decoding, which is derived by observing the behavior of log-likelihood ratio (LLR) values. Based on the behavior, the proposed criterion counts the number of absolute LLR values less than a threshold and the number of hard decision 1's in order to complete the iterative decoding procedure. Simulation results show that the proposed approach achieves a reduced number of iterations while maintaining similar BER/FER performance to the Drevious criteria.

[1]  Shu Lin,et al.  Two simple stopping criteria for turbo decoding , 1999, IEEE Trans. Commun..

[2]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[3]  Ivan J. Fair,et al.  Techniques for early stopping and error detection in turbo decoding , 2003, IEEE Trans. Commun..

[4]  Yufei W. Blankenship,et al.  A simple stopping criterion for turbo decoding , 2000, IEEE Communications Letters.

[5]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.