Scalable array architecture design for full search block matching

Abstract

Block matching is a widely used motion estimation algorithm in current video systems. Among typical searching strategies, the full search scheme provides better precision and regular data flow as well as higher parallelism, a characteristic that is advantageous for VLSI implementation. However, the huge computation load incurred by full search results in high cost, especially in high pixel rate applications. Since the block matching algorithm is used in a wide range of pixel rates, an architecture that is cascadable and offers variable computing power is promising. An approach based on dependence graph (DG) is proposed to analyze the operation sequence and data flow of full search block matching. The approach employs a transformation on DGs, called slice and tile, to produce different forms of DGs. Through this technique, most existing architectures can be represented in graphs for analysis, and new architectures can be found. A new architecture is presented that features cascadable modules of processing elements (PEs) with simple interconnection. Therefore, flexibility in computing power is available. The other advantages include variable sizes of the search area and 100% PE utilization. These characteristics offer great flexibility and efficiency for different applications. This architecture is implemented with thirty-two PEs in one chip that consists of 102 K transistors.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>