By Topic

Highly concurrent reduced-complexity 2-D systolic array for discrete Fourier transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
P. K. Meher ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore

A simple two-dimensional (2-D) architecture is derived for highly concurrent systolization of the 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 ap(N/2). The proposed structure offers significantly lower latency, higher throughput, and involves nearly half the minimum of the area-time complexity of the existing multiplier-based DFT structures. It is found that the 2-D DFT using proposed one-dimensional (1-D) structure has nearly half the area-complexity and less than one-fourth of area-time complexity of the existing structures. Besides, it is also found to have nearly half the area-time complexity of the existing multiplierless DFT structure. Unlike some of the existing structures, the proposed one can be used for the DFT of any transform-length and does not involve tag-bit control

Published in:

IEEE Signal Processing Letters  (Volume:13 ,  Issue: 8 )