
Accession Number : AD0749871
Title : Discrete Fourier Transform for 360/67 Computing System (CooleyTukey FFT Method).
Descriptive Note : Technical note,
Corporate Author : MASSACHUSETTS INST OF TECH LEXINGTON LINCOLN LAB
Personal Author(s) : Vote,Fred W.
Report Date : 14 SEP 1972
Pagination or Media Count : 41
Abstract : 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 CooleyTukey method adapted from the theory of I. J. Good, and modified to leave the transformed results in a nonpermitted 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)
Descriptors : (*COMPUTER PROGRAMMING, INTEGRAL TRANSFORMS), COMPUTER PROGRAMS, FOURIER ANALYSIS, SAMPLING, ALGORITHMS, SUBROUTINES
Subject Categories : Theoretical Mathematics
Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE