Global routing with crosstalk constraints

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 18, Issue 11, 1999, Pages 1683-1688

  Zhou, Hai ^a   Wong, D F ^a  

^a SYNOPSYS INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CROSSTALK; ELECTRIC WIRE; INTEGRATED CIRCUIT LAYOUT; MATHEMATICAL MODELS; TREES (MATHEMATICS);

GLOBAL ROUTING ALGORITHMS; LAGRANGIAN RELAXATION TECHNIQUE;

VLSI CIRCUITS;

EID: 0033350808     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.806813     Document Type: Article

References (14)

1. H. B. Bakoglu, Circuits, Interconnections, and Packaging for VLSI. Reading, MA: Addison-Wesley, 1990.
2. K. Chaudhary, A. Onozawa, and E. S. Kuh, "A spacing algorithm for performance enhancement and cross-talk reduction," in Proc. Int. Conf. Computer-Aided Design, Santa Clara, CA, Nov. 1993, pp. 697-702.
3. T. Gao and C. L. Liu, "Minimum crosstalk channel routing," in Proc. Int. Conf. Computer-Aided Design, Santa Clara, CA, Nov. 1993, pp. 692-696.
4. _, "Minimum crosstalk switchbox routing," in Proc. Int. Conf. Computer-Aided Design, San Jose, CA, Nov. 1994, pp. 610-615.
5. D. A. Kirkpatrick and A. L. Sangiovanni-Vincentelli, "Techniques for crosstalk avoidance in the physical design of high-performance digital systems," in Proc. Int. Conf. Computer-Aided Design, San Jose, CA, Nov. 1994, pp. 616-619.
6. S. Thakur, K.-Y. Chao, and D. F. Wong, "An optimal layer assignment algorithm for minimizing crosstalk for three layer VHV channel routing," in Proc. Int. Symp. Circuits and Systems, Apr. 1995, pp. I207-1-210.
7. H. Zhou and D. F. Wong, "An optimal algorithm for river routing with crosstalk constraints," in Proc. Int. Conf. Computer-Aided Design, San Jose, CA, 1996, pp. 310-315.
8. T. Xue, E. S. Kuh, and D. Wang, "Post global routing crosstalk risk estimation and reduction," in Proc. Int. Conf. Computer-Aided Design, 1996, pp. 302-309.
9. T. Sakurai and K. Tamara, "Simple formulas for two and three dimensional capacitance," IEEE Trans. Electron Devices, pp. 183-185, 1983.
10. M. R. Garey and D. S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
11. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem. Amsterdam, The Netherlands: North-Holland, 1992.
12. T. H. Cormen, C. E. Leiserson, and R. H. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1989.
13. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Application. Englewood Cliffs, NJ: Prentice-Hall, 1993.
14. D. F. Wong and C. L. Liu, "A new algorithm for floorplan design," in Proc. Design Automation Conf., 1986, pp. 101-107.