Computation core binding in GTM mapping on reconfigurable computers
Xuejun Liang · 2006
A combinatorial optimization problem, where the cost function is the FPGA computation time and the constraint is the FPGA board resource, is formulated as a step in mapping generalized template matching operations onto an FPGA board. The problem is then simplified from a multiple FPGA chip case into a single FPGA chip case. Algorithms are proposed to solve the optimization problem. Experimental results are also given to show the efficiency of proposed algorithms.