An efficient approach for via minimization in multi-layer VLSI/PCB routing

An efficient track permutation technique and a powerful Constrained Via Minimization (CVM) approach are proposed for multi-layer routing of VLSI chips and PCBs. Track permutation technique combined with existing channel routing algorithms can improve the routing results by permuting the tracks. For our multi-layer CVM approach, two procedures-Maximum-Difference Reduction procedure and Backtracking procedure are developed. In particular, the Maximum-Difference Reduction problem can be successfully converted to that of Minimum Clique Number Augmentation, and a polynomial-time heuristic algorithm is thereafter derived. The algorithms are evaluated by some famous routing examples using three and five layers. The obtained results, 38 percent of vias eliminated on an average, are very encouraging.

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

[2]  Richard J. Enbody,et al.  Near-Optimal n-Layer Channel Routing , 1986, DAC 1986.

[3]  Tai-Tsung Ho New models for four- and five-layer channel routing , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[4]  Kuo-En Chang Constrained via minimization for three-layer routing , 1989 .

[5]  Maciej J. Ciesielski,et al.  An Optimum Layer Assignment for Routing in ICs and PCBs , 1981, 18th Design Automation Conference.

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

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

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

[9]  Richard J. Enbody,et al.  Near-Optimal n-Layer Channel Routing , 1986, 23rd ACM/IEEE Design Automation Conference.

[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]  E. Kuh,et al.  One-dimensional logic gate assignment and interval graphs , 1979, COMPSAC.

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

[13]  Sartaj Sahni,et al.  Constrained via minimization , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..