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 .

• Type: Conference
• Year: 1995
• Where: FPGA
• Authors: Dennis J.-H. Huang, Andrew B. Kahng
• Keywords: Dynamic Programming, FPGA, FPGA 1995, FPGA Library, Total Cost