This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Analysis of FFT Algorithms on Multiprocessor Systems
July 1983 (vol. 9 no. 4)
pp. 512-521
L.N. Bhuyan, Department of Electrical Engineering, University of Manitoba
A decimation-in-time radix-2 fast Fourier transform (FFT) algorithm is considered here for implementation in multiprocessors with shared bus, multistage interconnection network (MIN), and in mesh connected computers. Results are derived for data allocation, interprocessor communication, approximate computation time, and speedup of an N point FFT on any P available processing elements (PE's). Further generalization is obtained for a radix-r FFT algorithm. An N X N point two-dimensional discrete Fourier transform (DFT) implementation is also considered when one or more rows of the input data matrix are allocated to each PE.
Index Terms:
two-dimensional DFT, FFT algorithm, interprocessor communication, multiprocessor systems, performance analysis
Citation:
L.N. Bhuyan, D.P. Agarval, "Performance Analysis of FFT Algorithms on Multiprocessor Systems," IEEE Transactions on Software Engineering, vol. 9, no. 4, pp. 512-521, July 1983, doi:10.1109/TSE.1983.234959
Usage of this product signifies your acceptance of the Terms of Use.