Parameterizable VLSI architectures for the full-search block-matching algorithm

Systolic VLSI architectures for implementing the full-search block-matching algorithm are described. A large range of data rates can be efficiently covered by the proposed architectures. The input bandwidth problem for the search-area data is solved by on-chip line buffers, allowing a low frame-buffer access rate. An architecture for block-scan data input is described in detail. A VLSI realization with a low transistor count can be achieved by linear arrays in conjunction with compact memory blocks based on three-transistor cells. >

[1]  S. Kappagantula,et al.  Motion Compensated Predictive Coding , 1984, Optics + Photonics.

[2]  Tobias G. Noll,et al.  VLSI architectures for the full-search blockmatching algorithm , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[3]  P. Pirsch,et al.  Advances in picture coding , 1985, Proceedings of the IEEE.

[4]  M. Stegherr,et al.  A family of application-specific VLSI architectures for the block-matching algorithm , 1990 .

[5]  T Koga,et al.  MOTION COMPENSATED INTER-FRAME CODING FOR VIDEO CONFERENCING , 1981 .

[6]  Ming-Ting Sun,et al.  VLSI Implementation Of Motion Compensation Full-Search Block-Matching Algorithm , 1988, Other Conferences.

[7]  R. Tielert,et al.  A CMOS VLSI chip for filtering of TV pictures in two dimensions , 1986 .

[8]  Peter Pirsch,et al.  VLSI Architectures For Block Matching Algorithms , 1988, Other Conferences.

[9]  F. Jutand,et al.  A versatile and powerful chip for real-time motion estimation , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[10]  S. Ericsson Motion-compensated hybrid coding at 50 kb/s , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[11]  R. Srinivasan,et al.  Predictive Coding Based on Efficient Motion Estimation , 1985, IEEE Trans. Commun..