The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Analysis of DFT-based channel estimators for OFDM

På svenska

Author

Summary, in English

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 vs. 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.

Publishing year

2000

Language

English

Pages

55-70

Publication/Series

Wireless Personal Communications

Volume

12

Issue

1

Document type

Journal article

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

Research group

  • Radio Systems

ISBN/ISSN/Other

  • ISSN: 1572-834X