Efficient 2-D systolic array implementation of a prime factor DFT algorithm

A new two-dimensional systolic array for computing the discrete Fourier transform (DFT), with length N decomposable into the product of two relatively prime factors, 4M/sub 1/ and M/sub 2/, is presented. The architecture is constructed based on the row-column algorithm. It does not include any intermediate circuit for arranging data flow between the row-DFT and column-DFT modules. The system possesses the features of regularity and modularity, and is well suited to VLSI implementation. It has an efficiency of 100%, a throughput rate of one N-point transform per M/sub 2/ cycles, and an area*time/sup 2/ figure of AT/sup 2/=O((M/sub 1/+M/sub 2/)M/sub 2/N log/sub 2//sup 2/N), which is much smaller than the value of O(N/sup 3/ log/sub 2//sup 2/N) achieved by existing linear systolic array solutions.<>