Abstract
This paper describes a memory efficient array architecture with data-rings for the 3-step hierarchical search block-matching algorithm (3SHS). With the efficient data-rings and memory organization, the regular raster-scanned data flow and comparator-tree structure can be used to simplify control scheme and reduce latency, respectively. In addition, we utilize the three-half-search-area scheme and circular addressing method to reduce external memory access and memory size, respectively. The results demonstrate that the array architecture with memory efficient scheme requires a smaller memory size and low I/O bandwidth. It also provides a high normalized throughput solution for the 3SHS.
Original language | English |
---|---|
Pages (from-to) | 644-651 |
Number of pages | 8 |
Journal | IEEE Transactions on Consumer Electronics |
Volume | 47 |
Issue number | 3 |
DOIs | |
State | Published - 08 2001 |
Externally published | Yes |