Share Email Print

Proceedings Paper

New algorithm for computation of DCT through pyramidal addition
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Associative Processors can perform parallel operations in massive scale because of which they are found to be efficient for video coding. Due to the inherent nature of the architecture, performing DCT becomes computationally intensive. To overcome this drawback, multiple DCTs are performed in parallel. This approach results in huge data traffic as it is performed for multiple blocks of video data. In this paper we present a new approach to perform DCT on associative processor. In this approach we make use of the shape of DCT basis vectors to extract parallelism. Such an approach reduces both the average number of cycles and the data traffic involved in video coding. Further, the video coding can be performed on Macro block basis thereby reducing a huge number of redundant operations.

Paper Details

Date Published: 8 March 2005
PDF: 10 pages
Proc. SPIE 5683, Embedded Processors for Multimedia and Communications II, (8 March 2005); doi: 10.1117/12.588161
Show Author Affiliations
Subhash C. Balam, Univ. of Illinois/Chicago (United States)
Dan Schonfeld, Univ. of Illinois/Chicago (United States)

Published in SPIE Proceedings Vol. 5683:
Embedded Processors for Multimedia and Communications II
Subramania Sudharsanan; V. Michael Bove Jr.; Sethuraman Panchanathan, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?