Two-Dimensional Router for Double Layer Layout

A heuristic algorithm for two dimensional routing utilizing two distinct layers is presented. It is assumed that all terminals are on the boundary of a rectilinear routing region with or without initial routes present. The router produces a Manhattan-style routing collapsed into one layer. Another program decides the layering, however, it is not described here. By default, when the layering program is not used, vertical segments of routes are placed on one layer, horizontal on the other.

[1]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  D. A. Mlynski,et al.  Two-Dimensional Channel Routing and Channel Intersection Problems , 1982, DAC 1982.

[3]  Chi-Ping Hsu.  A New Two-Dimensional Routing Algorithm , 1982, DAC 1982.

[4]  Kenneth J. Supowit.  A Minimum-Impact Routing Algorithm , 1982, DAC 1982.

[5]  Yoji Kajitani,et al.  Order of Channels for Safe Routing and Optimal Compaction of Routing Area , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.