Conjugate conflict continuation graphs for multi-layer constrained via minimization

A graph model for describing the relationships among wire segments is crucial to constrained via minimization (CVM) in a VLSI design. In this paper we present a new graph model, called the conjugate conflict continuation graph, for multi-layer CVM with stacked vias. This graph model eases the handling of stacked via problems. An integer linear programming (ILP) formulation and a simulated annealing (SA) algorithm based on this graph model are developed to solve multi-layer CVM. The ILP model is too complicated to solve efficiently. The SA algorithm on average achieves 6.4% via reduction for layouts obtained using a commercial tool under a set of practical constraints in which the metal wires (including pins) used in cell layouts, power rails and rings, and clock routing are treated as obstacles or fixed-layer objects to a multi-layer CVM.

[1]  Hock Chuan Chua,et al.  A practical and efficient approach to the constrained via minimization problem , 2001, Comput. Electr. Eng..

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

[3]  Sumio Masuda,et al.  The Via Minimization Problem is NP-Complete , 1989, IEEE Trans. Computers.

[4]  Wen-Guey Tzeng,et al.  Three-Quarter Approximation for the Number of Unused Colors in Graph Coloring , 1999, Inf. Sci..

[5]  Wu-Shiung Feng,et al.  Constrained via minimization with practical considerations for multi-layer VLSI/PCB routing problems , 1991, 28th ACM/IEEE Design Automation Conference.

[6]  David Hung-Chang Du,et al.  Layer Assignment Problem for Three-Layer Routing , 1988, IEEE Trans. Computers.

[7]  Hesham H. Ali,et al.  A new graph coloring algorithm for constrained via minimization , 1994, Proceedings of 1994 37th Midwest Symposium on Circuits and Systems.

[8]  Ernest S. Kuh,et al.  A unified approach to the via minimization problem , 1989 .

[9]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

[10]  Min Zhao,et al.  Layer assignment for crosstalk risk minimization , 2004 .

[11]  Philippe Hurat,et al.  DFM: linking design and manufacturing , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[12]  Maciej Ciesielski,et al.  Layer assignment for printed circuit boards and integrated circuits , 1992, Proc. IEEE.

[13]  Gan Jun.  A Multi-Layer Channel Routing Algorithm Based on Via Minimization , 2002 .

[14]  Jason Cong,et al.  A layout modification approach to via minimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Maolin Tang.  An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem , 2005, EvoCOP.

[16]  Ma Qi.  Constrained Via Minimization with Practical Considerations for Different-Styled Multi-Layer Routing , 2001 .

[17]  Youn-Long Lin,et al.  A graph-partitioning-based approach for multi-layer constrained via minimization , 1998, ICCAD 1998.

[18]  C.-J. Richard Shi.  Solving constrained via minimization by compact linear programming , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[19]  F. Barahona.  On via minimization , 1990 .

[20]  Kuang-Yao Lee,et al.  Post-routing redundant via insertion for yield/reliability improvement , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[21]  Majid Sarrafzadeh,et al.  Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering vor VLSI Applications , 1998, IEEE Trans. Computers.

[22]  C.-J. Richard Shi.  A signed hypergraph model of constrained via minimization , 1992, [1992] Proceedings of the Second Great Lakes Symposium on VLSI.

[23]  Jason Cong,et al.  An efficient approach to multilayer layer assignment with anapplication to via minimization , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[24]  R. Pinter.  Optimal layer assignment for interconnect , 1984 .

[25]  Toshimasa Watanabe,et al.  A heuristic algorithm to solve constrained via minimization for three-layer routing problems , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[26]  Kamran Eshraghian,et al.  An efficient approach to constrained via minimization for two-layer VLSI routing , 1999, Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198).

[27]  Wayne Wei-Ming Dai,et al.  Yield-preferred via insertion based on novel geotopological technology , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[28]  Paul Molitor,et al.  A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization , 1993, Integr..

[29]  Jiang Hu,et al.  Antenna avoidance in layer assignment , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[30]  Chi-Ping Hsu.  Minimum-Via Topological Routing , 1983, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[31]  Chia-Chun Tsai,et al.  An efficient approach for via minimization in multi-layer VLSI/PCB routing , 1995, Proceedings of the IEEE 1995 Custom Integrated Circuits Conference.