Abstract
ABSTRACTThis paper presents an efficient methodology for decomposing and modularizing large computations so that they can be easily mapped ontoFPGAs and other programmable logic structures. The paper focuses on the multidimensional Discrete Cosine Transform (DCT). The main advantage of the proposed decomposition strategy is that it enables constructing large m- dimensional DCTs from a single stage of smaller size rn-dimensional DCTs.We demonstrate the power of our technique by mapping 2-d DCT computationsof various sizes on an FPGA-based transformable computer8 and report theirperformance (both in terms of speed and gate utilization). Keywords: discrete cosine transform, FPGAs, reconfigurable computing, recursive algorithms, highly parallel architectures. 1. INTRODUCTION The Discrete Cosine Transform (DCT) is a fundamental computation that arises in many important image and video processing applications. Becauseit results in high compression ratio1'7, the two-dimensional (or 2-d) DCT is
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.
