Reduced-Complexity Iterative Decoding Using a Variable-Size Trellis Structure
Paper i proceeding, 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.


Dhammika Bokolamulla

Chalmers, Data- och informationsteknik, Datorteknik

Tor Aulin

Chalmers, Data- och informationsteknik, Datorteknik

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



Annan elektroteknik och elektronik

Mer information