A new parity-check stopping criterion for turbo decoding

This paper presents a simple and effective stopping criterion for Turbo decoding. This criterion is based on parity-check scheme, which is totally different from the cross-entropy (CE) based criteria. Simulations show that the proposed scheme achieves about the same performance in terms of bit-error-rate (BER) and saves more iterations, as compared with other well known CE-based stopping criteria. Furthermore, this parity- check scheme unveils the inner oneness of LDPC codes and turbo codes in the perspective of the decoding convergence, which is an original theoretical discovery.