Implementation of sum of absolute difference using optimized partial summation term reduction
Nehal N. Shah, Khyati R. Agarwal, Harikrishna M. Singapuri · 2013
Video has vast application domains like medicine, security and surveillance. Video coding can be implemented in both hardware and software technologies in which both quality and controllability are required. Process of determining motion vectors known as motion estimation (ME) is a fundamental step in the extraction of activity in videos. The Block Matching Algorithm (BMA) based motion estimation is the most popular method in which the distance measurement between objects in consecutive frame can be computed based on matching criterions called cost function which computes the distortion between the blocks. The massive computations associated with block matching prevent software implementations from running in real-time and lead towards hardware implementation. Due to simplicity in hardware implementation, SAD is preferred cost function in block matching. Several architectures using Sum of Absolute difference (SAD) are developed to improve the hardware efficiency and computational speed of block-matching algorithms. This paper gives comparative analysis of area and speed of operation for Sequential, Pipeline and Parallel architectures for SAD implementation. Parallel architecture provides best throughput at the cost of highest resource utilization. For performing absolute difference (AD) and summation, adder and carry propagate mechanisms are required. In this paper optimized architecture for accumulation of computed AD in Parallel architecture is presented using partial summation term reduction technique which reduces adders by 40% and improve speed of operation around 12% to 43% for various FPGA families.