Pin assignment for wire length minimization after floorplanning phase

Abstract

In this paper, we present a pin assignment algorithm which can be applied after jloorplanning phase for wire length optimization. In order to reassign pins globally for all the nets, we formulate a Mixed Integer Linear Programming (MILP) for this problem. Since the MILP problem is a NP-hard problem, and the solution space is on a large scale, we introduce a simulated annealing algorithm to solve the MILP problem. The results show that our algorithm canfurther reduce the wire length by 10.22% within less than one minute averagely. ',