Simplified Criteria for Early Iterative Decoding Termination

Two novel stopping criteria for iterative decoding or turbo codes are introduced in this paper. The proposed criteria are shown to substantially reduce the required computational complexity, while the achieved bit-error rate is not significantly affected, compared to results based on previously published stopping criteria. Computational complexity reduction is achieved by reducing the number or iterations. Further complexity reduction is achieved by reducing the volume of the data on which the criteria operate. The proposed criteria are shown to reduce the required computational complexity by a factor of ten for cases of practical interest. Two solutions are presented that allow the exploitation of a performance-complexity trade-off