Parallel 2-D FFT algorithms on an eight-neighbor processor array

The two-dimensional fast Fourier transform (2-D FFT), which has a wide application in areas such as digital signal processing, speech recognition and image processing, require quite high-speed computing to handle a huge amount of data. Many parallel hardware FFT algorithms have been proposed. The paper discusses 2-D FFT hardware algorithms which are implemented on an eight-neighbor processor array. They allow 2-D FFT computation to be processed by iterating a 2-D butterfly operation and a data transfer alternately. These algorithms combine effectively the direct 2-D FFT algorithm and the communication capability of the 8-neighbor processor array