Analysis of DFT-Based Channel Estimators for OFDM

  • Authors:
  • Ove Edfors;Magnus Sandell;Jan-Jaap Van De Beek;Sarah Kate Wilson;Per Ola Börjesson

  • Affiliations:
  • Department of Applied Electronics, Lund University, S-221 00 Lund, Sweden;Bell Labs, Lucent Technologies, Windmill Hill Business Park, Swindon SN5 6PP, U.K.;Nokia Svenska AB, R&D, S-164 22 Kista, Sweden;Division of Signal Processing, Luleå University of Technology, S-971 87 Luleå, Sweden;Department of Applied Electronics, Lund University, S-221 00 Lund, Sweden

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we analyze the performance of three low-complexity channelestimators, based on the discrete Fourier transform (DFT), for orthogonalfrequency-division multiplexing (OFDM) systems. Estimators of this type havebeen analyzed for discrete-time channels, and we extend this analysis tocontinuous-time channels. We present analytical expressions for theirmean-squared error (MSE) and evaluate their complexity vs. symbol-error rate(SER) for 16-QAM. The analysis shows that this type of estimators mayexperience an irreducible error floor at high SNRs. However, in one of thethree estimators the error floor can be eliminated while the complexity stayslow and the performance is maximized.