Abstract
A “prime factor” Fast Fourier Transform algorithm is described which is self-sorting and computes the transform in place. With a view to implementation on a Cray-1 or Cyber 205, the form of the algorithm is chosen to minimize the number of additions. With an appropriate choice of index mapping in the derivation, we obtain the unexpected result that the required indexing is actually simpler than that for a conventional FFT. The construction of the necessary “rotated” DFT modules is described, and comparisons are presented between the new algorithm and the conventional FFT in terms of operation counts and timings on an IBM 3081; on this machine, the new transform algorithm takes about 60% of the time for the conventional FFT. A Fortran routine for the new algorithm is outlined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
