DocumentCode
2061437
Title
Reduced-complexity iterative decoding using a variable-size trellis structure
Author
Bokolamulla, Dhammika ; Aulin, Tor
Author_Institution
Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden
fYear
2004
fDate
27 June-2 July 2004
Firstpage
489
Abstract
We propose a new reduced-complexity iterative decoding algorithm. The main concept is to approximate the aposteriori probabilities (APP) by a set of few sequences, and to reduce the size of this set with iterations. According to the numerical results on the bit error rate (BER) performance and the convergence behavior by extrinsic information transfer (EXIT) chart analysis, the algorithm could obtain a good balance between performance and complexity.
Keywords
error statistics; iterative decoding; probability; trellis codes; APP; BER; EXIT; aposteriori probability; bit error rate; extrinsic information transfer chart analysis; iterative decoding algorithm; variable-size trellis structure; Algorithm design and analysis; Approximation algorithms; Bidirectional control; Bit error rate; Concatenated codes; Convergence of numerical methods; Information analysis; Iterative algorithms; Iterative decoding; Performance analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365529
Filename
1365529
Link To Document