A simple 2-dimensional architecture is derived for highly concurrent systolization of the 2-dimensional (2-D) discrete Fourier transform (DFT). The concurrency of computation has been enhanced and complexity is minimized by the proposed algorithm where an N -point DFT is computed via four inner-products of real-valued data of length ? (N/2). The proposed structure offers significantly lower latency, twice the throughput, and involves nearly the same area-time complexity of the existing multiplier-based DFT structures.
['Pramod Kumar Meher', 'Jagdish Chandra Patra', 'A. P. Vinod']
A 2-D Systolic Array for High-Throughput Computation of 2-D Discrete Fourier Transform