Parallel implementation of arbitrary-shaped MPEG-4 decoder for multiprocessor systems

Milan Pastrnak; Peter H. N. de With; Sander Stuijk; Jef van Meerbergen

doi:10.1117/12.641631

19 January 2006 Parallel implementation of arbitrary-shaped MPEG-4 decoder for multiprocessor systems

Milan Pastrnak, Peter H. N. de With, Sander Stuijk, Jef van Meerbergen

Proceedings Volume 6077, Visual Communications and Image Processing 2006; 60771I (2006) https://doi.org/10.1117/12.641631
Event: Electronic Imaging 2006, 2006, San Jose, California, United States

Abstract

MPEG-4 is the first standard that combines synthetic objects, like 2D/3D graphics objects, with natural rectangular and non-rectangular video objects. The independent access to individual synthetic video objects for further manipulation creates a large space for future applications. This paper addresses the optimization of such complex multimedia algorithms for implementation on multiprocessor platforms. It is shown that when choosing the correct granularity of processing for enhanced parallelism and splitting time-critical tasks, a substantial improvement in processing efficiency can be obtained. In our work, we focus on non-rectangular (also called arbitrary-shaped) video objects decoder. In previous work, we motivated the use of a multiprocessor System-on-Chip(SoC) setup that satisfies the requirements on the overall computation capacity. We propose the optimization of the MPEG-4 algorithm to increase the decoding throughput and a more efficient usage of the multiprocessor architecture. First, we present a modification of the Repetitive Padding to increase the pipelining at block level. We identified the part of the padding algorithm that can be executed in parallel with the DCT-coefficient decoding and modified the original algorithm into two communicating tasks. Second, we introduce a synchronization mechanism that allows the processing for the Extended Padding and postprocessing (Deblocking & Deringing) filters at block level. The first optimization results in about 58% decrease of the original Repetitive-Padding task computational requirements. By introducing the previously proposed data-level parallelism and exploiting the inherent parallelism between the separated color components (Y, Cr, Cb), the computational savings are about 72% on the average. Moreover, the proposed optimizations marginalize the processing latency from frame size to slice order-of-magnitude.

Citation Download Citation

Milan Pastrnak, Peter H. N. de With, Sander Stuijk, and Jef van Meerbergen "Parallel implementation of arbitrary-shaped MPEG-4 decoder for multiprocessor systems", Proc. SPIE 6077, Visual Communications and Image Processing 2006, 60771I (19 January 2006); https://doi.org/10.1117/12.641631

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