A novel scalable architecture with memory interleaving organization for full search block-matching algorithm
Yeong-Kang Lai, Liang‐Gee Chen, Tsung-Han Tsai, Po-Cheng Wu · 2002
This paper describes a high-throughput scalable architecture for full-search block-matching algorithm (FSBMA). The number of processing elements (PEs) is scalable according to the variable algorithm parameters and the performance required for different applications. By use of the efficient PE-rings and the intelligent memory-interleaving organization, the efficiency of the architecture can be increased. Techniques for reducing interconnections and external memory accesses are also presented. Our results demonstrate that the scalable PE-ringed architecture is a flexible and high-performance solution for FSBMA.