THREE FORTRAN PROGRAMS THAT PERFORM THE COOLEY-TUKEY FOURIER TRANSFORM

Abstract

Three programs are described and listed, all written in USASI Basic Fortran, which perform the discrete Fourier transform upon a multidimensional array of floating point data. The data may be either real or complex, with a savings in running time for real over complex. The transform values are always complex and are returned in the array used to carry the original data. The running time is much shorter than that of any program performing a direct summation, even when sine and cosine values are precalculated and stored in a table. For example, on a CDC 3300 with floating point add time of six microseconds, a complex array of size 80 x 80 can be transformed in 19.2 seconds. Besides the main array, only a working storage array of size 160 need be supplied.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 28, 1967
Accession Number
AD0657019

Entities

People

  • N. M. Brenner

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Combinatorial Analysis
  • Composite Materials
  • Computations
  • Computer Programs
  • Convolution
  • Discrete Fourier Transforms
  • Fast Fourier Transforms
  • Integrals
  • Mathematics
  • Microsecond Time
  • Numerical Analysis
  • Periodic Functions
  • Precision
  • Sequences
  • Three Dimensional

Fields of Study

  • Engineering

Readers

  • Approximation Theory.
  • Computer Programming and Software Development.