30 May 2000 Computation complexity analysis and VLSI architectures of shape coding for MPEG-4
Author Affiliations +
Proceedings Volume 4067, Visual Communications and Image Processing 2000; (2000) https://doi.org/10.1117/12.386564
Event: Visual Communications and Image Processing 2000, 2000, Perth, Australia
Abstract
There are huge bit-level operations in shape coding algorithms for MPEG-4. These bit-level operations make it difficult to implement real-time MPEG-4 coding in the general-purpose processor without any hardware support. This paper first gives the analysis of computation complexity in MPEG-4 shape coding algorithms. Then a dedicated VLSI architecture to accelerate shape coding, which is called Shape Engine, is proposed. Shape Engine is composed of three dedicated but flexible processors element (PE) namely PB-PE, Filtering-PE and CAE-PE. The combination of RISC core and Shape Engine leads to a great speed up over pure software implementation of MPEG-4 shape coding.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Danian Gong, Danian Gong, Yun He, Yun He, } "Computation complexity analysis and VLSI architectures of shape coding for MPEG-4", Proc. SPIE 4067, Visual Communications and Image Processing 2000, (30 May 2000); doi: 10.1117/12.386564; https://doi.org/10.1117/12.386564
PROCEEDINGS
12 PAGES


SHARE
Back to Top