A new efficient systolic architecture for the 2D discrete Fourier transform
Chang-Yu Chen, Chin-Liang Wang · 2003
Proposes a 2D systolic array for performing the 2D N*N-point discrete Fourier transform (DFT). This array is constructed based on the use of the Goertzel algorithm to realize the 2-D DFT in a row-column-wise or column-row-wise format. Unlike the conventional row-column decomposition method, the proposed system involves no matrix transposition problems. In addition, the system possesses the features of regularity, modularity, and concurrency. As a consequence, it is well suited to VLSI implementation and has a very high throughput of one 2-D transition per N cycles. Moreover, the utilization efficiency of the proposed system is 100%, and the latency (processing time for a single 2-D transform) is 4N-1 cycles. In terms of the area-time complexity, the proposed approach is a fast design and reaches the lower bound.>