multi-way system partitioning into a single type or multiple types of fpgas
This paper considers the problem of partitioning a circuit into a collection of subcircuits, such that each subcircuit is feasible for some device from an FPGA library, and the total cost of devices is minimized. We propose a three-phase heuristic that uses ordering, clustering, and dynamic programming to achieve good solutions. Experimental comparisons are made with the previous methods of [4][9].
systems partition types fpgas paper circuits collect device libraries cost heuristics order cluster dynamic programming experimentation method