TEG: a new post-layout optimization method

Post-layout is an important stage in the modern very large scale integration (VLSI) design. In this stage, the extraction and verification tools can get the most accurate results with the complete layout information, and the layout problems can be detected precisely for further design improvements or optimizations. But the problem is that the design optimization is very hard to perform in post-layout. Every design modification is under tight geometry constraints. Usually the designer either changes layout manually by layout editor, or goes back to previous placement or routing stage in order to have the preferred results. How to modify the layout becomes a bottleneck in the post-layout optimization. In this paper, we propose a new method to resolve this problem called the triangulation encoding graph (TEG) method. Based on an improved topological layout representation and a set of layout operation algorithms, TEG provides an incremental layout modification environment for post-layout optimizations. Experimental results show that TEG is efficient and effective in processing industry VLSI designs.

[1]  Toshiyuki Hama,et al.  Topological routing path search algorithm with incremental routability test , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[2]  Sartaj Sahni,et al.  Planar topological routing , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Shuo Zhang,et al.  TEG: a new post-layout optimization method , 2002, ISPD '02.

[4]  Wayne Wei-Ming Dai,et al.  Rubber band routing and dynamic data representation , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[5]  D. T. Lee,et al.  A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion , 2000, Algorithmica.

[6]  I. Ali,et al.  Chemical-mechanical polishing of interlayer dielectric: a review , 1994 .

[7]  Donald S. Fussell,et al.  Topological channel routing [VLSI] , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Wayne W.-M. Dai,et al.  Topological encoding and interchangeable pin routing , 1997 .

[9]  Jason Cong,et al.  On the k-layer planar subset and topological via minimization problems , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Richard Cole,et al.  River Routing Every Which Way, but Loose (Extended Abstract) , 1984, FOCS.

[11]  D. Boning,et al.  The physical and electrical effects of metal-fill patterning practices for oxide chemical-mechanical polishing processes , 1998 .

[12]  D. T. Lee,et al.  On crossing minimization problem , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Jason Cong,et al.  A provably good multilayer topological planar routing algorithm in IC layout designs , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  JOHN VALAINIS,et al.  Two-dimensional IC layout compaction based on topological design rule checking , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Wayne Wei-Ming Dai,et al.  SURF: rubber-band routing system for multichip modules , 1993, IEEE Design & Test of Computers.

[16]  Wayne Wei-Ming Dai,et al.  A numerical stable algorithm for constructing constrained Delaunay triangulation and application to multichip module layout , 1991, China., 1991 International Conference on Circuits and Systems.

[17]  F. Joel Ferguson,et al.  Carafe: an inductive fault analysis tool for CMOS VLSI circuits , 1993, Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium.

[18]  Andrew B. Kahng,et al.  Filling algorithms and analyses for layout density control , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  F. Miller Malley,et al.  Single-Layer Wire Routing and Compaction , 1989 .

[20]  Charles E. Leiserson,et al.  Algorithms for routing and testing routability of planar VLSI layouts , 1985, STOC '85.

[21]  Majid Sarrafzadeh,et al.  A new approach to topological via minimization , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..