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

被引：38

作者：

Reisenfeld, S ^{[1
]}

Aboutanios, E ^{[1
]}

机构：

[1] Univ Technol Sydney, Cooperat Res Ctr Satellite Syst, Fac Engn, Sydney, NSW 2007, Australia

来源：

IEEE COMMUNICATIONS LETTERS | 2003年 / 7卷 / 11期

关键词：

Discrete Fourier transform (DFT); fast Fourier transform (FFT); frequency estimation; interpolation;

D O I：

10.1109/LCOMM.2003.815637

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

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.

引用

页码：549 / 551

页数：3

共 7 条

[1]

Aboutanios E., 2002, Ph.D. Thesis

[2] Estimation of frequency, amplitude, and phase from the DFT of a time series [J].

Quinn, BG .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1997, 45 (03) :814-817

[3] ESTIMATING FREQUENCY BY INTERPOLATION USING FOURIER COEFFICIENTS [J].

QUINN, BG .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1994, 42 (05) :1264-1268

[4] SINGLE-TONE PARAMETER ESTIMATION FROM DISCRETE-TIME OBSERVATIONS [J].

RIFE, DC ;

BOORSTYN, RR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (05) :591-598

[5]

RIFE DC, 1973, THESIS POLYTECHNIC I

[6]

Sveshnikov A. A., 1968, PROBLEMS PROBABILITY

[7]

U TECHN, 2002, Patent No. 20022950296

← 1 →