1 |
D.L. Jones, A resolution comparison of several time-frequency representations, IEEE Trans. Signal Process. 40 (1992), no. 2, 413-420.
DOI
ScienceOn
|
2 |
A. Oppenheim and D. Johnson, Computation of spectra with unequal resolution using the fast Fourier transform, Proc. IEEE 59 (1971), 299-301.
|
3 |
P. Duhamel and H. Hollmann, Spilt-radix FFT algorithm, Electronics Letters 20 (1984), no.1, 14-16.
DOI
ScienceOn
|
4 |
P. Duhamel and M. Vetterli, Fast Fourier transforms: a tutorial review and a state of the art, Signal Processing 19 (1990), 259-299.
DOI
ScienceOn
|
5 |
L. Greengard and JY. Lee, Accelerating the nonuniform fast Fourier transform, SIAM Rev. 46 (2004), no. 3, 443-454.
DOI
ScienceOn
|
6 |
S. Winograd, On computing the discrete Fourier transform, Math. Comp. 32 (1978), no. 141, 175-199.
DOI
ScienceOn
|
7 |
X.G. Xia, Discrete Chirp-Fourier transform and its application to Chirp rate estimation, IEEE Trans. Signal Process. 48 (2000), no. 11, 3122-3133.
DOI
ScienceOn
|
8 |
G. Beylkin, On the fast Fourier transform of functions with singularities, Appl. Comput. Harmon. Anal. 2 (1995), 363-381.
DOI
ScienceOn
|
9 |
E.O. Brigham, The fast Fourier transform and its applications, Prentice-Hall International Inc. New Jersey, 1988.
|
10 |
E. Candes, L. Demanet and L. Ying, Fast computation of Fourier integral operators, Math. NA, 0610051v1(2006), 1-31.
|
11 |
P. Carr and D.B. Madan, Option valuation using the fast Fourier transform, Journal of Computational Finance 2 (1999), no. 4, 1-18.
|
12 |
J.W. Cooley, and J.W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comp. 19 (1965), no 90, 297-301.
DOI
ScienceOn
|
13 |
M.E. Deisher and A.S. Spanias, Adaptive noise cancellation using fast optimum block algorithms, IEEE Int. Symposium on Circuits and Systems 1, 698-701, 1991.
|