Translator Disclaimer
8 March 2005 New algorithm for computation of DCT through pyramidal addition
Author Affiliations +
Proceedings Volume 5683, Embedded Processors for Multimedia and Communications II; (2005) https://doi.org/10.1117/12.588161
Event: Electronic Imaging 2005, 2005, San Jose, California, United States
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Subhash C. Balam and Dan Schonfeld "New algorithm for computation of DCT through pyramidal addition", Proc. SPIE 5683, Embedded Processors for Multimedia and Communications II, (8 March 2005); https://doi.org/10.1117/12.588161
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
Back to Top