Korean Journal of Mathematics

The Kangwon-Kyungki Mathematical Society (강원경기수학회)
권호 표지
DOI QR코드

DOI QR Code

A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM

  • Kim, HwaJoon (Department of Computational Mathematics in Rangsit University) ;
  • Lekcharoen, Somchai (Department of Computational Mathematics in Rangsit University)
  • Received : 2010.01.23
  • Accepted : 2011.07.25
  • Published : 2011.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

We would like to propose a Cooley-Tukey modied algorithm in fast Fourier transform(FFT). Of course, this is a kind of Cooley-Tukey twiddle factor algorithm and we focused on the choice of integers. The proposed algorithm is better than existing ones in speeding up the calculation of the FFT.

Keywords

References

  1. G. Beylkin, On the fast Fourier transform of functions with singularities, Appl. Comput. Harmon. Anal. 2 (1995), 363-381. https://doi.org/10.1006/acha.1995.1026
  2. E.O. Brigham, The fast Fourier transform and its applications, Prentice-Hall International Inc. New Jersey, 1988.
  3. E. Candes, L. Demanet and L. Ying, Fast computation of Fourier integral operators, Math. NA, 0610051v1(2006), 1-31.
  4. P. Carr and D.B. Madan, Option valuation using the fast Fourier transform, Journal of Computational Finance 2 (1999), no. 4, 1-18.
  5. 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. https://doi.org/10.1090/S0025-5718-1965-0178586-1
  6. 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.
  7. D.L. Jones, A resolution comparison of several time-frequency representations, IEEE Trans. Signal Process. 40 (1992), no. 2, 413-420. https://doi.org/10.1109/78.124951
  8. A. Oppenheim and D. Johnson, Computation of spectra with unequal resolution using the fast Fourier transform, Proc. IEEE 59 (1971), 299-301.
  9. P. Duhamel and H. Hollmann, Spilt-radix FFT algorithm, Electronics Letters 20 (1984), no.1, 14-16. https://doi.org/10.1049/el:19840012
  10. P. Duhamel and M. Vetterli, Fast Fourier transforms: a tutorial review and a state of the art, Signal Processing 19 (1990), 259-299. https://doi.org/10.1016/0165-1684(90)90158-U
  11. L. Greengard and JY. Lee, Accelerating the nonuniform fast Fourier transform, SIAM Rev. 46 (2004), no. 3, 443-454. https://doi.org/10.1137/S003614450343200X
  12. S. Winograd, On computing the discrete Fourier transform, Math. Comp. 32 (1978), no. 141, 175-199. https://doi.org/10.1090/S0025-5718-1978-0468306-4
  13. X.G. Xia, Discrete Chirp-Fourier transform and its application to Chirp rate estimation, IEEE Trans. Signal Process. 48 (2000), no. 11, 3122-3133. https://doi.org/10.1109/78.875469

Cited by

  1. Spectral Analysis of Torsional Vibrations Measured by Optical Sensors, as a Method for Diagnosing Injector Nozzle Coking in Marine Diesel Engines vol.21, pp.3, 2011, https://doi.org/10.3390/s21030775