A low complexity hardware architecture for motion estimation

This paper tackles the problem of accelerating motion estimation for video processing. A novel architecture using binary data is proposed, which attempts to reduce power consumption. The solution exploits redundant operations in the sum of absolute differences (SAD) calculation, by a mechanism known as early termination. Further data redundancies are exploited by using a run length coding addressing scheme, where access to pixels which do not contribute to the final SAD value is minimised. By using these two techniques operations and memory accesses are reduced by 93.29% and 69.17% respectively relative to a systolic array implementation

[1]  Kenneth Y. Yun,et al.  A low-power VLSI architecture for full-search block-matching motion estimation , 1998, IEEE Trans. Circuits Syst. Video Technol..

[2]  K. Ohmori,et al.  A 60 MHz 240 mW MPEG-4 video-phone LSI with 16 Mb embedded DRAM , 2000, 2000 IEEE International Solid-State Circuits Conference. Digest of Technical Papers (Cat. No.00CH37056).

[3]  Noel E. O'Connor,et al.  An efficient motion estimation hardware architecture for MPEG-4 binary shape coding , 2005 .

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

[5]  Tihao Chiang,et al.  A novel all-binary motion estimation (ABME) with optimized hardware architectures , 2002, IEEE Trans. Circuits Syst. Video Technol..

[6]  Anantha Chandrakasan,et al.  A binary block matching architecture with reduced power consumption and silicon area requirement , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

[7]  H. Mehrpour,et al.  Adaptive block matching motion estimation algorithm using bit-plane matching , 1995, Proceedings., International Conference on Image Processing.