Timing and crosstalk driven area routing

We present a timing and crosstalk driven router for the chip assembly task that is applied between global and detailed routing. Our new approach aims to process the crosstalk and timing constraints by ordering nets and tuning wire spacing in a quantitative way. Our graph-based optimizer preroutes wires on the global routing grids incrementally in two stages - net order assignment and space relaxation. The timing delay of each critical path is calculated taking into account interconnect coupling capacitance. The objective is to reduce the delays of critical nets with negative timing slack values, by tuning net ordering and adding extra wire spacing. It shows a remarkable 8.4-25% delay reduction for MCNC benchmarks for wire geometric ratio=2.0, against a 33% delay reduction if interconnect interference disappear.

[1]  P. F. Dubois,et al.  New advances in the routing of mixed analog and digital channels , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[2]  C. L. Liu,et al.  Minimum crosstalk channel routing , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Dongsheng Wang,et al.  Post global routing crosstalk risk estimation and reduction , 1996, Proceedings of International Conference on Computer Aided Design.

[4]  Carl Sechen,et al.  Multi-layer chip-level global routing using an efficient graph-based Steiner tree heuristic , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[5]  Malgorzata Marek-Sadowska,et al.  Crosstalk reduction for VLSI , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Donghui Li,et al.  Fast coupled noise estimation for crosstalk avoidance in the MCG multichip module autorouter , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Ernest S. Kuh,et al.  A spacing algorithm for performance enhancement and cross-talk reduction , 1993, ICCAD.

[8]  Carl Sechen,et al.  Chip-level area routing , 1998, ISPD '98.

[9]  C. L. Liu,et al.  Minimum crosstalk switchbox routing , 1994, ICCAD.

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

[11]  Wen-Chung Kao,et al.  Cross point assignment with global rerouting for general-architecture designs , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  W. C. Elmore The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .

[13]  Alberto L. Sangiovanni-Vincentelli,et al.  A routing methodology for analog integrated circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[14]  Soonhoi Ha,et al.  COP: a Crosstalk OPtimizer for gridded channel routing , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Hai Zhou,et al.  An optimal algorithm for river routing with crosstalk constraints , 1996, ICCAD 1996.

[16]  A. Sangiovanni-Vincentelli,et al.  Constraint-based channel routing for analog and mixed analog/digital circuits , 1990, ICCAD 1990.

[17]  Alberto Sangiovanni-Vincentelli,et al.  Digital sensitivity: predicting signal interaction using functional analysis , 1996, ICCAD 1996.

[18]  Hsiao-Ping Tseng,et al.  Detailed routing algorithms for vlsi circuits , 1997 .

[19]  C. Sechen,et al.  New algorithms for the placement and routing of macro cells , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[20]  Ernest S. Kuh,et al.  Glitter: A Gridless Variable-Width Channel Router , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  A.L. Sangiovanni-Vincentelli,et al.  Techniques For Crosstalk Avoidance In The Physical Design Of High-performance Digital Systems , 1994, IEEE/ACM International Conference on Computer-Aided Design.