A Design Space Exploration Algorithm for Sliding-Window Operations

This paper presents a design space exploration algorithm for sliding-window operations.By finding the three upper bounds according to area constraints,memory bandwidth constraints and on-chip memory constraints,the block structure of the design which can fully utilize the available resources on the board is determined.Experimental results show that the efficiency of memory usage can be increased to 85%.In comparison with related work of array partition,the number of memory accesses can be reduced by 2% to 20%.