Abstract
An algorithm is described for computing two and three dimensional Fourier transforms on computers of SIMD architecture. The algorithm assumes the existence of a library routine for the calculation of a 2-d Fourier transform on a set of Np2 data points where Np2 is the number of processing elements. The paper discusses how to use this routine to calculate 2-d Fourier transforms on a set of N2 data points where NpN is a power of two, using an interleaving technique. The paper also discusses the use of the 2-d results in conjunction with base ‘r1 + r2’ FFT algorithms to calculate 3-d Fourier transforms on a set of N3 complex data points. In the final section a general program is described to calculate 3-d Fourier transforms for any values of N and Np such that NpN is a power of two. Timings are given for the algorithms run on an ICL Distributed Array Processor.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
