Cut ranking and pruning: enabling a general and efficient FPGA mapping solution
FPGA, pp. 29-35, 1999.
efficient fpga mapping solutioncomputational complexityram
Cut enumeration is a common approach used in a numberof FPGA synthesis and mapping algorithms for considerationof various possible LUT implementations at each nodein a circuit. Such an approach is very general and flexible,but often suffers high computational complexity andpoor scalability. In this paper, we develop several efficientand ...More
Best Paper of FPGA, 1999