摘要
This paper describes the VLSI implementation with two-dimensional (2-D) data-reuse architecture for full-search block-matching algorithm. Based on a one-dimensional processing element (PE) array and two data-interlacing shift-register arrays, the proposed VLSI architecture can efficiently reuse data to decrease external memory accesses and save the pin counts. It also achieves 100% hardware utilization and a high throughput rate. In addition, the same chips can be cascaded for different block sizes, search ranges, and pixel rates.
| 原文 | 英語 |
|---|---|
| 頁(從 - 到) | 623-629 |
| 頁數 | 7 |
| 期刊 | IEEE Transactions on Consumer Electronics |
| 卷 | 44 |
| 發行號 | 3 |
| DOIs | |
| 出版狀態 | 已出版 - 1998 |
| 對外發佈 | 是 |