The Community for Technology Leaders
Green Image
Issue No. 04 - July (1983 vol. 9)
ISSN: 0098-5589
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.
two-dimensional DFT, FFT algorithm, interprocessor communication, multiprocessor systems, performance analysis

L. Bhuyan and D. Agarval, "Performance Analysis of FFT Algorithms on Multiprocessor Systems," in IEEE Transactions on Software Engineering, vol. 9, no. , pp. 512-521, 1983.
92 ms
(Ver 3.3 (11022016))