A Parallel Algorithm for Computing FFT on MIMD Parallel Computers

An effcient parallel algorithm of block diagonalization of coefficient matrix for calculating fast fourier transform (FFT) on the computer network or multiple instruction stream & multiple data stream (MIMD) parallel computers is presented in this paper.Beacuse it need not exchange data between computers during parallel computing,this parallel algorithm is especially suitable for implementation on the computer network and MIMD parallel computers whose communicational rate and bandwith are low.