Efficient partitioning of parameterized 45-degree polygons with mixed ILP

Abstract

Partitioning parameterized polygons is an essential process in a proposed layout-aware analog integrated circuit design flow. To deal with constraints associated with parameterized polygons, constraint programming (CP) technologies have been used in a previous partitioning algorithm. Although CP solvers are capable of coping with complex constraints, CP-based partitioning processes can be very time-consuming. In this paper, we propose the use of mixed integer linear programming (MILP) solvers in the partitioning of parameterized 45-degree polygons. Experimental results show that more than 150X speedup can be achieved for partitioning parameterized polygons containing very complex constraints.