FFT on a New Parallel Vector Processor

A new parallel processing system has been proposed, and a prototype model of the system has been constructed. It is designed to perform parallel vector operations at maximum efficiency. In addition, it can also handle communicating vector operations, and hence exploit irregular parallelism present in many apparently sequential algorithms. The system is therefore suitable for a wide range of algorithms with varying degrees of parallelism. In this paper, we give a brief description of the system, and discuss the implementation of the Cooley-Tukey FFT on this system. We show that the system's versatility allows it to achieve a near maximum degree of parallelism for this algorithm in the asymptotic case.