Constrained via minimization for three-layer routing

Abstract The constrained via minimization problem for VLSI three-layer routing is the problem of determining which layers can be used for routing the wire segments in the interconnections of nets so that the number of vias is minimized. This problem has been shown to be NP-complete 15 . In this paper, this problem is first transformed to the contractibility problem of a three-colourable graph, then an heuristic algorithm is proposed on the basis of the graph contractability model. From experimental results, the algorithm proves faster and more efficient at generating very good results. For a typical case, the number of vias can be reduced by about 30%.

[1]  Malgorzata Marek-Sadowska.  An Unconstrained Topological Via Minimization Problem for Two-Layer Routing , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[3]  Yun Kang Chen,et al.  Three-Layer Channel Routing , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[5]  Franco P. Preparata,et al.  Optimal Three-Layer Channel Routing , 1984, IEEE Transactions on Computers.

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

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

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

[9]  Vijay Pitchumani,et al.  A Mixed HVH-VHV Algorithm for Three-Layer Channel Routing , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Ernest S. Kuh,et al.  The constrained via minimization problem for PCB and VLSI design , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[11]  Kuo-En Chang,et al.  The Topological Order Determination for Three-Layer Channel Routing Problem , 1988 .

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

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

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