Purushotham, J and Basu, A and Kulkarni, D and Patnaik, LM (1994) Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays. In: Computers & Electrical Engineering, 20 (4). 319-326 .
PERFORMANCE.pdf - Published Version
Restricted to Registered users only
Download (499Kb) | Request a copy
In this paper a pipelined ring algorithm is presented for efficient computation of one and two dimensional Fast Fourier Transform (FFT) on a message passing multiprocessor. The algorithm has been implemented on a transputer based system and experiments reveal that the algorithm is very efficient. A model for analysing the performance of the algorithm is developed from its computation-communication characteristics. Expressions for execution time, speedup and efficiency are obtained and these expressions are validated with experimental results obtained on a four transputer system. The analytical model is then used to estimate the performance of the algorithm for different number of processors, and for different sizes of the input data.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier science.|
|Keywords:||Discrete Fourier Transform;efficiency;Fast Fourier Transform (FFT;message passing multiprocessor;OCCAM;pipelined ring algorithm;speedup;transputers|
|Date Deposited:||08 Apr 2011 08:56|
|Last Modified:||08 Apr 2011 08:56|
Actions (login required)