Routing in standard cells

A routing in standard cells is presented. It consists of a global and detailed routing. The problem of the global routing, aiming to minimize simultaneously wire length and density through routing regions, has been solved by a weighted Steiner tree. The detailed routing is considered as the problem of routing in a channel and in a switchbox. An advanced and enhanced greedy based algorithm for the channel routing is shown. For the switchbox routing problem an algorithm that minimizes congestion in the center of the routing region has been developed.