An efficient new systolic architecture for the solution of discrete Fourier transform
R. Baghaie, I.O. Hartimo · 2002
By using the even-odd decomposition method, an efficient word level systolic array for implementation of an N-point discrete Fourier transforms (DFT) has been developed. With the aid of a 4-point pre-processor consisting of some simple adders, implementation of a fully-pipelined N-point DFT can be achieved by using only (N/4 + 1) CORDIC processing elements. One of the features of this architecture is that no index mapping is required. Having throughput of O(N), hardware requirements are reduced by a factor of four compare to other systolic implementations with the same throughput.>