On accelerating the FFT of Cooley and Tukey

Authors

  • SK MISHRA ndian Institute of Tropical Meteorology, Pune

DOI:

https://doi.org/10.54302/mausam.v36i2.1833

Abstract

The efficient Fourier transform (EFT) and FFT algorithms are described and their computational efficiencies with respect to the direct method are discussed. An efficient procedure is proposed for the reordering of data set; the use of EFT algorithm for the initial Fourier transforms and restricting the size of final subsets to not less than 4 is also suggested for saving computation time in the FFT. It is found that on average the FFT with the proposed modifications is more than twice as fast as the original FFT. The amount of overhead operations involved in computer routine, based on the modified FFT is estimated.

Downloads

Published

01-04-1985

How to Cite

[1]
S. MISHRA, “On accelerating the FFT of Cooley and Tukey”, MAUSAM, vol. 36, no. 2, pp. 167–172, Apr. 1985.

Issue

Vol. 36 No. 2 (1985): MAUSAM

Section

Research Papers

License

Copyright (c) 2021 MAUSAM

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

All articles published by MAUSAM are licensed under the Creative Commons Attribution 4.0 International License. This permits anyone.

Anyone is free:

  • To Share - to copy, distribute and transmit the work
  • To Remix - to adapt the work.

Under the following conditions:

  • Share - copy and redistribute the material in any medium or format
  • Adapt - remix, transform, and build upon the material for any purpose, even
    commercially.