Lagrangian method for wire routing of layout design

Abstract

In this paper, we propose a new algorithm which solves the routing problem of LSI layout design as a continuous valued constrained optimization problem. All continuous valued wires change their values simultaneously according to the dynamic equations of Lagrangian method, hence this method is suitable for neurocomputing. We show that this method can solve the small switchbox routing problems with a higher completion rate as compared to the rip-up reroute maze router.