Novel routing schemes for IC layout part I: two-layer channel routing

We present new channel routing algorithms and theory that consider the characteristic of net crossings. ‘llte routing strategy is based on parallel bubble sorting and river routing tectilques. A fiction named POTENTfAL, cart be evaluated to indicate the required channel height for a given channel witbout actually carrying out the routing steps. Non-Manhattan wires as wefl as overlapping wires are introduced. Preliminary results show that a class of channel muting problems cart be muted in height less than the Manhattan density.

[1]  Michael Burstein,et al.  Hierarchical Channel Router , 1983, 20th Design Automation Conference Proceedings.

[2]  Yoshihide Igarashi,et al.  A Function for Evaluating the Computing Time of a Bubbling System , 1987, Theor. Comput. Sci..

[3]  Frank Thomson Leighton,et al.  An approximation algorithm for manhattan routing , 1983, STOC '83.

[4]  N. S. Barnett,et al.  Private communication , 1969 .

[5]  Gary L. Miller,et al.  Provably Good Channel Routing Algorithms , 1981 .

[6]  Susanne E. Hambrusch.  Channel Routing Algorithms for Overlap Models , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Alberto L. Sangiovanni-Vincentelli,et al.  Techniques for multilayer channel routing , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  David N. Deutsch.  A “DOGLEG” channel router , 1976, DAC 1976.

[9]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  R. Rivest,et al.  New Lower Bounds for Channel Width , 1981 .

[11]  Ernest S. Kuh,et al.  Glitter: A Gridless Variable-Width Channel Router , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  R.L. Rivest,et al.  A "Greedy" Channel Router , 1982, 19th Design Automation Conference.

[13]  András Frank,et al.  Disjoint paths in a rectilinear grid , 1982, Comb..

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

[15]  Majid Sarrafzadeh.  Channel-Routing Problem in the Knock-Knee Mode Is NP-Complete , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.