DocumentCode
1319166
Title
Parallel FFT algorithms for MIMD computers
Author
Fung, M.K. ; Nandi, A.K.
Author_Institution
Dept. of Electr. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK
Volume
27
Issue
3
fYear
1991
Firstpage
286
Lastpage
288
Abstract
Two methods of computing the FFT (fast Fourier transform) concurrently by multiple computers are presented. Both methods have been implemented on a set of transputers. The first method runs on a simple cyclic network, whereas the second one requires a hypercube configuration. Based on simulations and analysis, their relative advantages and disadvantages in terms of speed-up performance, memory requirement, and host participation are discussed.
Keywords
fast Fourier transforms; hypercube networks; parallel algorithms; parallel architectures; FFT algorithms; MIMD computers; concurrent processing; cyclic network; fast Fourier transform; host participation; hypercube configuration; memory requirement; multiple input multiple data; speed-up performance; transputers;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19910181
Filename
83259
Link To Document