Reduced-Complexity Iterative Decoding Using a Variable-Size Trellis Structure
Paper in proceedings, 2004

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.

Author

Dhammika Bokolamulla

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Tor Aulin

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

IEEE International Symposium on Information Theory, Chicago. JUN 27-JUL 02, 2004

489-489

Subject Categories

Other Electrical Engineering, Electronic Engineering, Information Engineering

More information

Created

10/7/2017