2003
DOI: 10.1016/s0165-1684(03)00079-3
|View full text |Cite
|
Sign up to set email alerts
|

Frequency estimation using warped discrete Fourier transform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0
19

Year Published

2005
2005
2020
2020

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 38 publications
(30 citation statements)
references
References 8 publications
0
11
0
19
Order By: Relevance
“…The Cramer-Rao bound is included for reference as in [3] and the reciprocal value of the variance in dB is also shown. For the calculations the values L = 24, N = 64 are adopted.…”
Section: Frequency Estimationmentioning
confidence: 99%
See 1 more Smart Citation
“…The Cramer-Rao bound is included for reference as in [3] and the reciprocal value of the variance in dB is also shown. For the calculations the values L = 24, N = 64 are adopted.…”
Section: Frequency Estimationmentioning
confidence: 99%
“…A better es- timation of the positions of the spectra peaks can be obtained using large zero padding, thus leading to very large FFT lengths. In [3] a warped discrete Fourier transform is used and its performance is compared with several other procedures, namely: Dichotomous-search, Tretter's linear regression, Kay's phase difference and chirp Z-transform methods. Further readings and applications of this technique can be found in [2,4,5,[8][9][10].…”
Section: Introductionmentioning
confidence: 99%
“…Other approaches to the problem are based on multiple signal classification (MUSIC) algorithms, least mean-square (LMS) estimators, and DFT derivatives such as Goertzel algorithm (Evans, 1996). The approach taken in this paper is to explore the use of another DFT derivative called the warped discrete Fourier transform or WDFT (Makur et al, 2001;Franz et al, 2003).…”
Section: Introductionmentioning
confidence: 99%
“…Determining the frequencies, i.e., the locations of local maxima of the spectrum, is the most difficult problem in these methods. For this purpose, iterative algorithms have been applied [6][7][8][9][10], the nonparametric spectrum interpolation methods [11][12] are applicable (zero padding technique [13], chirped-Z transform [14][15][16][17], warped DFT [18][19][20] and interpolation by decimation [11]) and the methods of interpolated DFTs have been developed . Nonparametric spectrum interpolation methods make it possible to zoom in on the frequency domain but do not decrease the errors caused by long-range spectral leakage (i.e., by sidelobes of spectrum lines of neighbor components in the spectrum), which are defined by the frequency characteristic of the data window applied [47].…”
Section: Introduction: Spectral Analysis and The Unit Circle Approximmentioning
confidence: 99%