Discrete Fourier Transform for 360/67 Computing System (Cooley-Tukey FFT Method)

摘要

The paper describes a mathematical subroutine (FORIER) written for use on an IBM 360/370 computing system. FORIER computes a discrete Fourier transform. The algorithm used evaluates the complex Fourier series for complex functions. It is a version of the Cooley-Tukey method adapted from the theory of I. J. Good, and modified to leave the transformed results in a non-permitted order. The time required to transform N complex samples utilizing this method is proportional to N log N, rather than N squared required for a discrete Fourier transform employing a direct summation. (Author)