CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Reduced-Complexity Iterative Decoding Using a Variable-Size Trellis Structure

Dhammika Bokolamulla (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Tor Aulin (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
IEEE International Symposium on Information Theory, Chicago. JUN 27-JUL 02, 2004 p. 489-489. (2004)
[Konferensbidrag, refereegranskat]

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.



Denna post skapades 2006-01-19. Senast ändrad 2013-06-18.
CPL Pubid: 12567