An Efficient Parallel Algorithm for FFT

A new parallel processing system has been proposed.It is designed to perform parallelvector operations at maximum efficiency.In addition,it can also handle communicating vectoroperations,and hence exploit irregular parallelism present in many apparently sequentialalgorithms.The novel features of this architecture offer a new kind of multi-processor facilitywhich combines some of the advantages of an array processor with those of a vector processor.The system is therefore suitable for a wide range of algorithms with varying degrees ofparalielism.In this paper,we give a brief description of the system,and discuss theimplementation of the Cooley-Tukey FFT on this system with its simulation on Computer 757-the first vector computer of China.It is shown that the system’s versatility allows it to achievenearly a maximum degree of parallelism for this algorithm in the asymptotic case.