Vector Radix Fast Fourier Transform,

Abstract

A new radix-2 two-dimensional direct FFT is generalized in this paper to include arbitrary radices and non-square arrays. It is shown that the radix-4 version of this algorithm may require significantly fewer computations than conventional row-column transform methods. Also, the new algorithm eliminates the matrix transpose operation normally required when the array must reside on a bulk storage device. It requires the same number of passes over the array on bulk storage as efficient matrix transpose routines, but produces the transform in bit-reversed order. An additional pass over the data is necessary to sort the array if normal ordering is desired.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1977
Accession Number
ADA046523

Entities

People

  • David B. Harris
  • David S. K. Chan
  • Hans W. Schuessler
  • James H. Mcclellan

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Acoustics
  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Core Storage
  • Digital Signal Processing
  • Discrete Fourier Transforms
  • Equations
  • Fast Fourier Transforms
  • Fourier Series
  • Information Processing
  • Lepidoptera
  • Massachusetts
  • Signal Processing
  • Standards
  • Two Dimensional

Fields of Study

  • Engineering

Readers

  • Approximation Theory.
  • Linear Algebra
  • Parallel and Distributed Computing.