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

Author

Reisenfeld, Sam ; Aboutanios, Elias

Author_Institution

Cooperative Res. Center for Satellite Syst., Univ. of Technol., Sydney, NSW, Australia

Volume

7

Issue

11

fYear

2003

Firstpage

549

Lastpage

551

Abstract

The 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 digital signal processing applications, including communications, radar and sonar.

Keywords

AWGN; computational complexity; discrete Fourier transforms; error statistics; frequency estimation; interpolation; signal processing; Cramer-Rao bound; DFT; additive Gaussian noise; additive white Gaussian noise; complex exponential signal; complex fast Fourier transform; computational complexity; discrete Fourier transform; estimation error variance; frequency estimation; frequency interpolation; signal to noise ratio; Additive noise; Computational complexity; Digital signal processing; Discrete Fourier transforms; Fast Fourier transforms; Frequency estimation; Gaussian noise; Interpolation; Signal processing algorithms; Signal to noise ratio;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2003.815637

Filename

1246052