New recursive VLSI architectures for forward and inverse discrete cosine transform

Maurice F. Aburdene; Jianqing Zheng; Richard J. Kozick

doi:10.1117/12.234771

13 March 1996 New recursive VLSI architectures for forward and inverse discrete cosine transform

Maurice F. Aburdene, Jianqing Zheng, Richard J. Kozick

Proceedings Volume 2669, Still-Image Compression II; (1996) https://doi.org/10.1117/12.234771
Event: Electronic Imaging: Science and Technology, 1996, San Jose, CA, United States

Abstract

New recursive VLSI architectures for arbitrary length discrete cosine transform (DCT) and inverse DCT (IDCT) are presented. Compared with previous methods, the proposed approach saves N-1 adders but requires one additional delay element for the DCT implementation, and saves (N/2) multipliers for the IDCT. The reduction in elements results from identifying common computations in the processing that generates the transform components.

Citation Download Citation

Maurice F. Aburdene, Jianqing Zheng, and Richard J. Kozick "New recursive VLSI architectures for forward and inverse discrete cosine transform", Proc. SPIE 2669, Still-Image Compression II, (13 March 1996); https://doi.org/10.1117/12.234771

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available