Abstract

A discrete cosine transform (DCT) algorithm and architecture that minimize both software and hardware costs are presented. The proposed approaches are either direct or indirect and are based on the decomposition of the DCT in three operations: permutation, fast Fourier transform, and rotation. The main characteristics of the VLSI implementation chosen for this DCT and inverse DCT algorithm are show. Its data path coupled with a twin-pages memory and its controller, which contains the microprograms of the DCT algorithm are described. The results in terms of data processing rate and silicon area are given. >

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 call

Disclaimer: 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.