This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Two-Dimensional FFT Algorithm
June 1981 (vol. 3 no. 6)
pp. 698-701
Lawrence R. Johnson, Department of Computer Science, Michigan State University, East Lansing, MI 48823; SYSTEMS Engineering Laboratory, Fort Lauderdale, FL.
Anil K. Jain, Department of Computer Science, Michigan State University, East Lansing, MI 48823.
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.
Citation:
Lawrence R. Johnson, Anil K. Jain, "An Efficient Two-Dimensional FFT Algorithm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 6, pp. 698-701, June 1981, doi:10.1109/TPAMI.1981.4767174
Usage of this product signifies your acceptance of the Terms of Use.