The problem of implementing the FFT algorithm on a loosely coupled multiprocessor system is investigated. Starting with the conventional Cooley-Tukey algorithm for performing a single FFT, a parallel solution for a mesh connected computer architecture is reached. Transputers are chosen as the building blocks of the mesh. FFT is implemented as sequential and parallel tasks, respectively. The sequential implementation is measured on a single transputer system, whereas the parallel one is measured on a system consisting of four transputers. The algorithm is then analysed, the performance and speed-up figures are found for the realisation.
The implemented work is one form of the FFT algorithms which is expected to be useful and to preserve its characteristics on other loosely coupled similar architectures.