DocumentCode
1443547
Title
Multidimensional fast Fourier transform into SIMD hypercubes
Author
Zapata, E.L. ; Rivera, F.F. ; Benavides, I. ; Carazo, J.M. ; Peskin, R.
Author_Institution
Dept. Electron., Fac. de Fisica, Santiago de Compostela, Spain
Volume
137
Issue
4
fYear
1990
fDate
7/1/1990 12:00:00 AM
Firstpage
253
Lastpage
260
Abstract
The paper presents the in-place implementation of the multidimensional radix 2 fast Fourier transform (FFT), along with the corresponding algorithm for data shuffling (bit-reversal) on SIMD hypercube computers. Each processor possesses its own non-shared memory, the number of processors being less than or equal to the number of data. The flexibility of the proposed algorithm is based on the scheme of information storage that has been chosen and in the decomposition/configuration of the hypercube in subhypercubes that allow the parallel processing of multiple one-dimensional FFTs. This parallel FFT algorithm has an optimum performance, since the data redundancy is and the algorithmic complexity is optimum.
Keywords
computational complexity; fast Fourier transforms; parallel algorithms; SIMD hypercubes; algorithmic complexity; bit-reversal; configuration; data redundancy; data shuffling; decomposition; in-place implementation; information storage; multidimensional FFT; parallel processing;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings E
Publisher
iet
ISSN
0143-7062
Type
jour
Filename
54328
Link To Document