On the mapping of the discrete Fourier transform

Parallel- and pipeline-processor structures can maximise the speed-up factor and minimise the input/output cost in a network of transputers. These structures can implement most digital signal-processing applications. However, the paper concentrates on the evaluation of the discrete Fourier transform (DFT). The number of arithmetic operations and interprocessor transfers are used to evaluate the algorithms. Speed is shown to depend upon the distribution and sizes of data points and upon the numbers of transputers available