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

Low-complexity iterative detection based on limited bi-directional search

Dhammika Bokolamulla (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Anders Hansson ; Tor Aulin (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
IEE Proceedings Communications (1359-7019). Vol. 153 (2006), 6,
[Artikel, refereegranskad vetenskaplig]

A new reduced-complexity iterative decoding algorithm is introduced. The algorithm approximates a posteriori probabilities by using a set of highly sequences, found in a limited bi-directional search. To assess the performance, numerical results for serially concatenated convolutional codes, transmitted over an intersymbol interference channel, disturbed by additive white Gaussian noise are presented. A substantial reduction in complexity is achieved with a performance degradation around 0.25 dB, as demonstrated by bit error rate performance and convergence behaviour.

Nyckelord: Iterative detection, reduced complexity, bi-directional, forward-backward, a posterior probability

Denna post skapades 2006-12-27. Senast ändrad 2011-01-20.
CPL Pubid: 24648


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datorteknik (Chalmers)



Chalmers infrastruktur