Fast floorplanning with placement constraints

Abstract

Today's deep sub-micron technology and large complex designs have elevated the need for floorplanning to handle placement constraints. We present a unified method to handle alignment and cluster constraints on sequence pair representation. It helps pruning infeasible solutions on sequence pair and significantly reduces the solution space, therefore speeding up the algorithm. We also present an implementation methodology for fast evaluation of these constraints. Experimental results on MCNC and GSRC benchmarks demonstrate that our approach is 4.6X faster on average, scalable with good packing as compared to other published approaches.