Analysis of DFT-based channel estimators for OFDM
1996 (English)Report (Other academic)
In this paper we analyze the performance of three low-complexity channel estimators, based on the discrete Fourier-transform (DFT), for orthogonal frequency-division multiplexing (OFDM) systems. Estimators of this type have been analyzed for discrete-time channels, and we extend this analysis to continuous-time channels. We present analytical expressions for their mean-squared error (MSE) and evaluate their complexity versus symbol-error rate (SER) for 16-QAM. The analysis shows that this type of estimators may experience an irreducible error floor at high SNRs. However, in one of the three estimators the error floor can be eliminated while the complexity stays low and the performance is maximized.
Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 1996. , 25 p.
Research report / Luleå University of Technology1 jan 1974 → 31 dec 1996, ISSN 0347-0881 ; 1996:17
Research subject Signal Processing
IdentifiersURN: urn:nbn:se:ltu:diva-25584Local ID: fcaf58a0-df06-11dc-99e3-000ea68e967bOAI: oai:DiVA.org:ltu-25584DiVA: diva2:998637
Godkänd; 1996; 20080219 (ysko)2016-09-292016-09-29Bibliographically approved