A new algorithm for the estimation of the frequency of a complex exponential in additive Gaussian noise

Sam Reisenfeld, Elias Aboutanios

Research output: Contribution to journalArticlepeer-review

46 Citations (Scopus)

Abstract

This letter presents a new algorithm for the precise estimation of the frequency of a complex exponential signal in additive, complex, white Gaussian noise. The discrete Fourier transform (DFT)-based algorithm performs a frequency interpolation on the results of an N point complex fast Fourier transform. For large N and large signal to noise ratio, the frequency estimation error variance obtained is 0.063 dB above the Cramer-Rao Bound. The algorithm has low computational complexity and is well suited for real time applications.

Original languageEnglish
Pages (from-to)549-551
Number of pages3
JournalIEEE Communications Letters
Volume7
Issue number11
DOIs
Publication statusPublished - 2003
Externally publishedYes

Keywords

  • Discrete Fourier transform (DFT)
  • Fast Fourier transform (FFT)
  • Frequency estimation
  • Interpolation

Fingerprint Dive into the research topics of 'A new algorithm for the estimation of the frequency of a complex exponential in additive Gaussian noise'. Together they form a unique fingerprint.

Cite this