Fourier Transform Program for any Number of Data Points.

Abstract

The report describes a package of FORTRAN programs which perform Fourier analysis and synthesis on any number of user supplied data points. The basic algorithm employed is similar to the Fast Fourier Transform (FFT) algorithm developed by Cooley and Tukey, but is more general in that the number of data points need not be a power of two. Two transform routines are included: DFT, which computes either the Discrete Fourier Transform or its inverse given complex data points; and RDFT, which computes either the discrete Fourier Transform or its inverse given real data points. Also included is a routine called PSD which computes either Power Spectral Density or its integral given real data points. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1972
Accession Number
AD0754393

Entities

People

  • Joseph T. Holmes

Organizations

  • Naval Ordnance Laboratory

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Convolution Integrals
  • Discrete Fourier Transforms
  • Fast Fourier Transforms
  • Fourier Analysis
  • Integrals
  • Inverse Problems
  • Mathematical Analysis
  • Mathematics

Readers

  • Approximation Theory.
  • Computer Science.