VLSI architecture design of MPEG-4 shape coding

This paper presents an efficient VLSI architecture design of MPEG-4 shape coding, which is the key technology for supporting the content-based functionality of the MPEG-4 video standard. The real-time constraint of MPEG-4 shape coding leads to a heavy computational bottleneck on today's computer architectures. To overcome this problem, design analysis and optimization of MPEG-4 shape coding are addressed. By utilizing the RISC-based model, computational behaviors of the MPEG-4 shape coding tool are carefully examined and analyzed. The characteristic of a large amount of bit-level data processing and data transfer of MPEG-4 shape coding motivates the optimization of bit-level data operations. Applying data-flow optimization and data reuse techniques, bit-level computation-efficient architectures, such as data-dispatch-based binary-shaped motion estimation, the delay-line model, and configurable context-based arithmetic coding, are designed to accelerate bit-level processing. These hardware blocks are integrated and scheduled in a very efficient data flow to achieve real-time performance for MPEG-4 CPL2 (core profile level 2) specification at 23.5 MHz clock rate. The system architecture is implemented using Verilog HDL and synthesized with a 0.35 /spl mu/m four-layer CMOS standard library.

[1]  Liang-Gee Chen,et al.  Performance analysis and architecture evaluation of MPEG-4 video codec system , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[2]  E.E. Pissaloux,et al.  Image Processing , 1994, Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing.

[3]  Nam Ling,et al.  An architecture for MPEG-4 binary shape decoder , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[4]  Mladen Berekovic,et al.  The MPEG-4 Multimedia Coding Standard: Algorithms, Architectures and Applications , 1999, J. VLSI Signal Process..

[5]  Ming-Ting Sun,et al.  A family of vlsi designs for the motion compensation block-matching algorithm , 1989 .

[6]  William K. Pratt,et al.  Digital image processing (2nd ed.) , 1991 .

[7]  Liang-Gee Chen,et al.  Efficient algorithms and architectures for MPEG-4 object-based video coding , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[8]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[9]  Ruby B. Lee.  Subword parallelism with MAX-2 , 1996, IEEE Micro.

[10]  Konstantinos Konstantinides,et al.  Low-complexity block-based motion estimation via one-bit transforms , 1997, IEEE Trans. Circuits Syst. Video Technol..

[11]  Peter Pirsch,et al.  Architecture of a hardware module for MPEG-4 shape decoding , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[12]  R. W. Brodersen,et al.  Architectures and design techniques for real-time image-processing IC's , 1987 .

[13]  Fernando Pereira.  MPEG-4: Why, what, how and when? , 2000, Signal Process. Image Commun..

[14]  Jörn Ostermann.  Efficient encoding of binary shapes using MPEG-4 , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[15]  Noel Brady,et al.  Context-based arithmetic encoding of 2D shape sequences , 1997, Proceedings of International Conference on Image Processing.

[16]  Sung-Jea Ko,et al.  New motion estimation algorithm based on bit-plane matching and its VLSI implementation , 1999, Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030).

[17]  Joan L. Mitchell,et al.  Optimal Hardware and Software Arithmetic Coding Procedures for the Q-Coder , 1988, IBM J. Res. Dev..

[18]  P. Glenn Gulak,et al.  Architectural advances in the VLSI implementation of arithmetic coding for binary image compression , 1994, Proceedings of IEEE Data Compression Conference (DCC'94).

[19]  David A. Patterson,et al.  Computer Architecture - A Quantitative Approach, 5th Edition , 1996 .

[20]  Chaur-Heh Hsieh,et al.  VLSI architecture for block-matching motion estimation algorithm , 1992, IEEE Trans. Circuits Syst. Video Technol..

[21]  Walter Stechele,et al.  Complexity analysis of the emerging MPEG-4 standard as a basis for VLSI implementation , 1998, Electronic Imaging.

[22]  Ioannis Pitas,et al.  Fast computation of a class of running filters , 1998, IEEE Trans. Signal Process..

[23]  Yun He,et al.  Computation complexity analysis and VLSI architectures of shape coding for MPEG-4 , 2000, Visual Communications and Image Processing.

[24]  Peter Pirsch,et al.  Array architectures for block matching algorithms , 1989 .

[25]  Sven Bauer,et al.  The MPEG-4 video coding standard-a VLSI point of view , 1998, 1998 IEEE Workshop on Signal Processing Systems. SIPS 98. Design and Implementation (Cat. No.98TH8374).

[26]  Noel Brady.  MPEG-4 standardized methods for the compression of arbitrarily shaped video objects , 1999, IEEE Trans. Circuits Syst. Video Technol..