An Efficient Two-Dimensional FFT Algorithm

  • Authors:

  • Lawrence R. Johnson;Anil K. Jain

  • Affiliations:

  • Department of Computer Science, Michigan State University, East Lansing, MI 48823/ SYSTEMS Engineering Laboratory, Fort Lauderdale, FL.;Department of Computer Science, Michigan State University, East Lansing, MI 48823.

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 1981

Quantified Score

Hi-index 0.16

Visualization

Abstract

A new version of the radix-2 row-column method for computing two-dimensional fast Fourier transforms is proposed. It uses a ``multiple vector'' FFT algorithm to compute the transforms of all the columns in an array simultaneously while avoiding all trivial multiplications. The minicomputer implementation of the algorithm runs faster than the 2 脳 2 vector radix FFT algorithm. Analysis of the numbers of complex additions and multiplications required indicate that implementations of the radix-4 row-column FFT and 4 脳 4 vector radix FFT on the same minicomputer would run slower than the multiple vector implementation.