Singlelayer wire routing
Abstract
This dissertation concerns the problem of routing wires on a single layer of an integrated circuit or printed circuit board, starting from a sketch of the layer. A sketch specifies the positions of layout features and the topology of the interconnecting wires. Efficient algorithms are presented that: (1) determine whether a sketch is routable, and (2) produce for a routable sketch a proper routing that minimizes both individual and total wire length. Both algorithms run in time O(sq n log n) on input of size n, and both are simple to implement. They can be adapted to a variety of wiring models, and they subsume most of the polynomialtime algorithms in the literature for singlelayer routing and routability testing. The algorithms are based on two theorems concerning the routings of a sketch. One states that a sketch is routable if and only if for each cut between fixed features, the total amount of wiring forced to cross the cut is no greater than the length of the cut. The second theorem states that every routable sketch has a routing that simultaneously minimizes the length of every wire, and that it characterizes the wires in this routing. To formalize and prove these theorems, a rich mathematical theory of singlelayer wire routing is developed.
 Publication:

NASA STI/Recon Technical Report N
 Pub Date:
 August 1987
 Bibcode:
 1987STIN...8816932M
 Keywords:

 Integrated Circuits;
 Polynomials;
 Printed Circuits;
 Routes;
 Wire;
 Algorithms;
 Cutting;
 Efficiency;
 Input;
 Length;
 Size (Dimensions);
 Theorems;
 Electronics and Electrical Engineering