Efficient computation of one- and two-dimensional discrete Fourier transforms using the SIMD (single instruction stream-multiple data stream) mode of parallel processing is demonstrated. Algorithms for a variety of problem size-machine size combination are presented and analyzed. Radix two and radix four FFT schemes for SIMD systems are formulated.
