Fault tolerant systolic 2D array for DFT

The authors propose an algorithm for Fourier transform on a systolic array and its implementation. This systolic array is designed to be fault tolerant and to be used for Fourier transform and matrix operations. FFT is more common as the algorithm of Fourier transformation, but overhead demands for communication among processors are very high, and are therefore very expensive and limit the number of users. The proposed system is a two dimensional systolic array of processing elements (PEs) with short connecting lines between adjacent PEs, making it easy to use a large number of PEs. It is also considered to be fault tolerant. The authors propose a Fourier transform on a 2-D systolic array. Its processing speed is O(√N), which is next to that of the FFT