A Modified Fast Fourier Transform

Abstract

This report presents a derivation of the modified discrete Fourier transform, which has the property that the origin in frequency space appears in the center of the plot rather than at the edges (one dimension) or at the four corners (two dimensions), as in conventional treatments. Also included is a listing of an unusual fast Fourier transform (FFT) program for calculating the two-dimensional, modified discrete Fourier transform. The computer program makes use of the Eklundh fast matrix transposition algorithm and can transform arrays that are much too large to fit within the internal memory of the computer. By way of example, a complex array of size 2048 X 2048 can easily be transformed on a microcomputer with a 40-MB hard disk.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 24, 1990
Accession Number
ADA220567

Entities

People

  • Arden L. Steinbach
  • Cynthia H. Warner

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Access Time
  • Algorithms
  • Computations
  • Computer Programs
  • Computers
  • Convolution Integrals
  • Discrete Fourier Transforms
  • Fast Fourier Transforms
  • Fourier Transformation
  • Frequency
  • Frequency Domain
  • Integrals
  • Personal Computers
  • Precision
  • Procedures (Computers)
  • Statistics
  • Two Dimensional

Readers

  • Computer Science.
  • Parallel and Distributed Computing.
  • Wave Propagation and Nonlinear Chaotic Dynamics.

Technology Areas

  • Space