[PDF] Top 20 A flexible data-interlacing architecture for full-search block-matching algorithm

... Since different motion-compensation schemes may use different block sizes and require various search area sizes, i t is desirable t o have motion estimation chip flexibl[r] ... See full document

... The procedure of a block-matching algorithm is t o find the best matched displaced block from the previous frame Ft-1, within a search range, for each N x N block in th[r] ... See full document

... propose a semi-systolic array to improve the low efficiency problem as found in sys- tolic array ...of search data flow, we use a global distribution of search data connected to ... See full document

... Greater data reuse requires lower frame memory bandwidth, but uses more local ...memory. Data reuse Level D achieves the one-access goal of maximum saving in memory band- ...different data-reuse ... See full document

... second step, the search focuses on the area centered at the winner of the previous step, but the distances between can- didate locations arie shortened by half. In a similar[r] ... See full document

... paper, a novel low-power parallel tree architecture is pro- posed for full search block-matching motion ...tree architecture exploits the spatial data ... See full document

... its architecture design for fast block matching ...Our algorithm can solve several problems en- countered by ...current block, and then to precisely compare the best roughly ... See full document

... presents a new parallel global elimination algorithm and architecture for fast block ...only a few most probable candidates are required to determine the final motion vector with ... See full document

... paper, a low-power full-search block matching (FSBM) motion-estimation design for ITU-T recommendation ...16 block size with different searching ...proposed ... See full document

... with a minimum number of I/O pin count. The broad- casting signals in search area requests a special memory design [15] to speed up the motion vector (MV) ...same data flow onto a pure ... See full document

... of data and signals, respectively. For the sake of simplicity in illustration, we assume K = 3 in ...image data of the 1D search block and the K reference 1D ...implementation ... See full document

... As FSBM is used in different pixel rates, a scalable design that offers variable computing power and accommodates different sizes of search area would avoid the need[r] ... See full document

... for high-speed video applications; However, some archi- tectural considerations prevent this algorithm from be- ing widely used in real-time systems: First, the variable[r] ... See full document

... By the properly design for the PE cell, this architecture can fit variable block size and searching range requirement in a signal chip and still consumes less power. This [r] ... See full document

... the search algorithms are embedded into the MPEG encoder, it is important to inspect the computational complex- ity of the whole ...time for one video frame by using different block-matching ... See full document

... Al- though its search range overlaps that of other 3SHS’s and results in some overhead, it significantly improves performance because small motion vectors frequently occur in [r] ... See full document

... have their associated fitness values. witsh the maximum fit,ness value is to search among all the elements and to compare t,heir fitness values. However, the computational com[r] ... See full document

... (b) The hardware organization of the combiner module.. Next, we shall modify this parallel architec- ture so that it can execute the PRL algorithm, too. The necessary modifi[r] ... See full document

... employed a cross search pattern at the initial step to exploit the characteristics of the center-biased motion vector distribution very efficient, followed by the halfway-stop technique, and the large/small ... See full document

... one search algorithm outperforms the others? In this paper, we propose a systematic approach to examine this ...of search points achievable by a PBME algorithm form a ... See full document