Generalized terminal connectivity problem for multilayer layout scheme

Abstract Given a set of n horizontal (or vertical) wire segments run on different layers with variable widths (or heights), and a set of m terminals placed on different layers and with arbitrary rectangular shapes, a generalization of the terminal connectivity problem (TCP) is considered. This TCP can be applied to facilitate the VLSI or PCB multi-layer layout. First, it is proved that this TCP is NP-hard by showing that it is equivalent to a minimal steiner tree problem, which has been proved NP-complete. Then an efficient algorithm for the TCP is presented which runs in O ( m + (1 + c ) nn ) time (with some preprocessing work). Experimental results are given to verify the effectiveness of the algorithm.

[1]  Y. Eric Cho.  A subjective review of compaction (tutorial session) , 1985, DAC.

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

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

[4]  Witold Lipski,et al.  Finding a manhattan path and related problems , 1983, Networks.

[5]  Andrew D. Brown.  Automated placement and routing , 1988 .

[6]  J. Soukup.  Circuit layout , 1981, Proceedings of the IEEE.

[7]  Paul Losleben,et al.  Topological Analysis for VLSI Circuits , 1979, 16th Design Automation Conference.

[8]  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.

[9]  D. A. Mlynski,et al.  Automatic multilayer routing for surface mounted technology , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[10]  Makoto Takashima,et al.  Programs for Verifying Circuit Connectivity of MOS/LSI Mask Artwork , 1982, DAC 1982.

[11]  Walter S. Scott,et al.  Plowing: Interactive Stretching and Compaction in Magic , 1984, 21st Design Automation Conference Proceedings.

[12]  Chia-Chun Tsai,et al.  GENERATED TERMINAL CONNECTIVITY PROBLEM FOR MULTI-LAYER LAYOUT SCHEME , 1989 .

[13]  Takao Asano,et al.  Generalized Manhattan path algorithm with applications , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Witold Lipski,et al.  An O(n log n) Manhattan Path Algorithm , 1984, Inf. Process. Lett..

[15]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.