An H-V alternating router

An H-V alternating router based on the concurrent H (horizontal) and V (vertical) tile expansions is presented. The router is modeled by a sequence of alternating H and V corner-stitching space tiles, where the expansion direction is controlled by a heuristic evaluation function using the A* technique and the damping concept. Tile growing is governed by the following three factors: constrained expansion area, limited expansion depth, and oriented expansion direction. All the H-V tile expansion operations can be easily performed on a specially designed net-forest structure. It is shown that this approach generates nearly optimal connection paths with a minimum number of bends and always guarantees a feasible solution if such a path exists. The performance of this router is better than that of H-only tile-expansion routers. This router is also well suited for wiring hierarchical modules with the metal-metal matrix technology and can be extended to multilayer layouts. >

[1]  D. N. Deutsch.  Solutions to a Switchbox Routing Problem , 1985 .

[2]  Dave Hightower.  A solution to line-routing problems on the continuous plane , 1969, DAC '69.

[3]  Sung-Mo Kang.  Metal--Metal Matrix (M /sup 3/) for High-Speed MOS VLSI Layout , 1987, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Shi Kai-jian,et al.  Efficient routing algorithm , 1987 .

[5]  John K. Ousterhout,et al.  Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  F. Rubin,et al.  The Lee Path Connection Algorithm , 1974, IEEE Transactions on Computers.

[7]  Chia-Chun Tsai,et al.  An H-V Tile-Expansion Router , 1990, J. Inf. Sci. Eng..

[8]  Masayoshi Tachibana,et al.  A Hardware Maze Router with Application to Interactive Rip-Up and Reroute , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Edwin Kinnen,et al.  An Analytical Method for Compacting Routing Area in Integrated Circuits , 1982, DAC 1982.

[10]  David Hung-Chang Du,et al.  Efficient Algorithms for Layer Assignment Problem , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  Francesco Curatelli,et al.  A reconfigurable wiring algorithm for three-layer maze routing , 1989, Integr..

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

[13]  Amar Mukherjee,et al.  Introduction to Nmos and Cmos Vlsi Systems Design , 1986 .

[14]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[15]  Chia-Chun Tsai,et al.  New iterative construction approach to routing with compacted area , 1991 .

[16]  Gary W. Clow.  A Global Routing Algorithm for General Cells , 1984, 21st Design Automation Conference Proceedings.

[17]  Alessandro De Gloria,et al.  A Tile-Expansion Router , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  Maciej J. Ciesielski,et al.  Digraph Relaxation for 2-Dimensional Placement of IC Blocks , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  Ronald L. Rivest,et al.  A "Greedy" Channel Router , 1982, DAC 1982.

[20]  Willy M. C. Sansen,et al.  A Line-Expansion Algorithm for the General Routing Problem with a Guaranteed Solution , 1980, 17th Design Automation Conference.

[21]  T. Ohtsuki,et al.  Layout design and verification , 1986 .

[22]  Nils J. Nilsson.  SEARCH STRATEGIES FOR AI PRODUCTION SYSTEMS , 1982 .

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Gwo-Dong Chen,et al.  A database management system for a VLSI design system , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[25]  J. G. Xiong.  Algorithms for Global Routing , 1986, DAC 1986.

[26]  John K. Ousterhout,et al.  A Switchbox Router with Obstacle Avoidance , 1984, 21st Design Automation Conference Proceedings.

[27]  T. C. Chern,et al.  Fast algorithm for optimal layer assignment , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[28]  Werner L. Schiele.  Improved Compaction by Minimized Length of Wires , 1983, 20th Design Automation Conference Proceedings.

[29]  Maciej J. Ciesielski.  Two-Dimensional Routing for the Silc Silicon Compiler , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.