Share Email Print

Proceedings Paper

Computation complexity analysis and VLSI architectures of shape coding for MPEG-4
Author(s): Danian Gong; Yun He
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 30 May 2000
PDF: 12 pages
Proc. SPIE 4067, Visual Communications and Image Processing 2000, (30 May 2000); doi: 10.1117/12.386564
Show Author Affiliations
Danian Gong, Tsinghua Univ. (China)
Yun He, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 4067:
Visual Communications and Image Processing 2000
King N. Ngan; Thomas Sikora; Ming-Ting Sun, 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?