Year-end Sale % OFF 
Abstract
The authors present an algorithm and its systolic implementation for computing the 1-D N-point inverse discrete cosine transform (IDCT), where N is a power of two. The architecture requires (N2 – 1)/3 multipliers and can evaluate one N-point IDCT every clock cycle. Owing to the features of regularity and modularity, the architecture is well suited to VLSI implementation. Compared with existing related arrays, the proposed algorithm has a better area-time performance. In addition, it can be extended to implementing the 2-D IDCT based on the row-column decomposition method.
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.
