By Topic

A stepwise approach to computing the multidimensional fast Fourier transform of large arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
G. Anderson ; Exxon Production Research Company, Houston, TX

We consider the problem of performing a two-dimensional fast Fourier transform (FFT) on a very large matrix in limited core memory. We propose a decomposition of the Cooley-Tukey algorithm to allow efficient utilization of core memory and mass storage. The number of input/output operations is greatly reduced, with no increase in the computational burden. The method is suitable for nonsquare matrices and arrays of three or more dimensions.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:28 ,  Issue: 3 )