Two-Dimensional Channel Routing and Channel Intersection Problems

A two-dimensional channel routing program for hierarchical IC layout with orthogonal building blocks of variable size and shape is presented. A two dimensional channel model and a one layer channel router are used. A detailed description of the routing scheme which avoids the generation of “switch box” problems is given. The behavior of the two-dimensional routing algorithm to single and coupled channel intersections is demonstrated.

[1]  Chi-Ping Hsu.  A New Two-Dimensional Routing Algorithm , 1982, 19th Design Automation Conference.

[2]  David N. Deutsch,et al.  A “DOGLEG” channel router , 1976, DAC '76.

[3]  Ulrich Lauther,et al.  A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation , 1979, 16th Design Automation Conference.

[4]  J. Soukup.  Circuit layout , 1981, Proceedings of the IEEE.

[5]  Koji Sato,et al.  MIRAGE - A Simple-Model Routing Program for the Hierarchical Layout Design of IC Masks , 1979, 16th Design Automation Conference.