Convergence properties of iterative turbo decoding based on the number of searched states

Author

Assalini, Antonio ; Borgo, Mauro ; Pupolin, Silvano

Author_Institution

Dept. of Inf. Eng., Padova, Italy

Volume

3

fYear

2002

fDate

27-30 Oct. 2002

Firstpage

956

Abstract

We investigate the evolution of the trellis path through the state diagram of a turbo code versus the number of iterations n_i. Simulations show that the BER and the number of states with probability above a given threshold have the same convergence behavior versus n_i. 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.

Keywords

channel estimation; computational complexity; convergence of numerical methods; convolutional codes; error statistics; iterative decoding; turbo codes; BER; channel parameters estimation; convergence behavior; convergence properties; iterative turbo decoding; optimum solution; probability; recursive systematic convolutional code; reduced computational complexity; searched states; simulation results; simulations; state diagram; trellis path evolution; turbo code; 3G mobile communication; Bit error rate; Code standards; Computational complexity; Convergence; Iterative algorithms; Iterative decoding; Parameter estimation; Signal to noise ratio; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on

ISSN

1347-6890

Print_ISBN

0-7803-7442-8

Type

conf

DOI

10.1109/WPMC.2002.1088319

Filename

1088319