We investigate the evolution of the trellis path through the state diagram of a turbo code versus the number of iterations ni. Simulations show that the BER and the number of states with probability above a given threshold have the same convergence behavior versus ni. As a consequence we propose a new criterion to stop the iterative decoding process. A new algorithm to avoid the channel parameters estimation is proposed too. The joint combination of the proposed algorithms perform the same as the optimum solution with reduced computational complexity.
Convergence Properties of Iterative Turbo Decoding Based on the Number of Searched States
ASSALINI, ANTONIO;BORGO, MAURO;PUPOLIN, SILVANO
2002
Abstract
We investigate the evolution of the trellis path through the state diagram of a turbo code versus the number of iterations ni. Simulations show that the BER and the number of states with probability above a given threshold have the same convergence behavior versus ni. As a consequence we propose a new criterion to stop the iterative decoding process. A new algorithm to avoid the channel parameters estimation is proposed too. The joint combination of the proposed algorithms perform the same as the optimum solution with reduced computational complexity.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
