Abstract
The two-dimensional discrete Fourier transform, (2-D DFT) is commonly employed in image processing systems. In this paper, a new systolic architecture is proposed for fast computation of the 2-D DFT. The system is constructed by using a recursive algorithm to compute the separable 2-D discrete Hartley transform (DHT) and then converting the result into the 2-D DFT. It possesses the features of regularity and modularity, and is thus well suited to VLSI implementation. As compared to the systolic 2-D DFT design described by Chen and Wang (1992), which reaches the lower bound of area-time complexity, the proposed one achieves the same throughput performance but saves the hardware complexity by a factor of 8. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
