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

reportActive / Technical Report | Accession Number: AD0749871 | Need Help?

Abstract:

The paper describes a mathematical subroutine FORIER written for use on an IBM 360370 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

Author(s):
Vote, Fred W.
Author Organization(s):
MASSACHUSETTS INST OF TECH LEXINGTON LINCOLN LAB
Descriptive Note:
Technical note,
Pagination:
0041

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
TN-1972-32, ESD-TR-72-232
Contract/Grant Number(s):
F19628-73-C-0002
Project Number(s):
AF-649L
Monitor Series:
TR-72-232
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*COMPUTER PROGRAMMING, INTEGRAL TRANSFORMS), COMPUTER PROGRAMS, FOURIER ANALYSIS, SAMPLING, ALGORITHMS, SUBROUTINES
Field(s)/Group(s):
Theoretical Mathematics, Computer Programming and Software
Keyword(s):
SIGNAL PROCESSING, FORTRAN, FORTRAN 4 PROGRAMMING LANGUAGE, FOURIER TRANSFORMATION, IBM 360 67 COMPUTERS, COOLEY TUKEY ALGORITHM, FOURIER TRANSFORMATION
Report Date:
1972 Sep 14