Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Analysis of DFT-based channel estimators for OFDM

Författare

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.

Publiceringsår

2000

Språk

Engelska

Sidor

55-70

Publikation/Tidskrift/Serie

Wireless Personal Communications

Volym

12

Issue

1

Dokumenttyp

Artikel i tidskrift

Förlag

Springer

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

Forskningsgrupp

  • Radio Systems

ISBN/ISSN/Övrigt

  • ISSN: 1572-834X