Numerical Fourier Transform

Abstract

Numerical techniques for the analysis of digitized time-amplitude traces are presented, with special emphasis on Fast Fourier transforms. Accuracy of computation is improved by the use of linearly interpolated functions; for equispaced input the subprogram FLAT uses the Cooley-Tukey algorithm, while NUFT may be employed for the nonequispaced case. Although FLAT and NUFT can be used to perform inverse Fourier transforms, the special subprograms FLIT and INUFT compute these functions more efficiently. An analysis of the errors introduced by digitization, interpolation, and the computation of Fourier transforms is included.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1976
Accession Number
ADA030147

Entities

People

  • Alfred G. Brandstein
  • Egon Marx

Organizations

  • Harry Diamond Laboratories

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Accuracy
  • Algorithms
  • Amplitude
  • Analytic Functions
  • Computations
  • Computers
  • Discrete Fourier Transforms
  • Errors
  • Fast Fourier Transforms
  • Frequency
  • Intervals
  • Numbers
  • Power Series
  • Power Spectra
  • Procedures (Computers)
  • Sampling
  • Time Domain

Readers

  • Approximation Theory.