Low-complexity iterative channel estimation for serially concatenated systems over frequency-nonselective Rayleigh fading channels

A low-complexity iterative maximum a posteriori (MAP) channel estimator is proposed whose complexity increases linearly with the symbol alphabet size 'M. Prediction-based MAP channel estimation is not appropriate with a high-order prediction filter or a large modulation alphabet size, since the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on wireless communications 2007-02, Vol.6 (2), p.438-442
Hauptverfasser: JoonBeom Kim, Stuber, G.L., Ye Li
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A low-complexity iterative maximum a posteriori (MAP) channel estimator is proposed whose complexity increases linearly with the symbol alphabet size 'M. Prediction-based MAP channel estimation is not appropriate with a high-order prediction filter or a large modulation alphabet size, since the computational complexity increases with M L , where L is the predictor order. In contrast, the proposed channel estimator has a constant number of trellis states regardless of the prediction filter order, and is shown to provide comparable error performance to the prediction-based MAP estimator
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2007.05289