An ECO algorithm for eliminating crosstalk violations

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2004, Pages 41-46

  Xiang, Hua ^a   Chao, Kai Yuan ^b   Wong, Martin D F ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b INTEL CORPORATION   (United States)

^c CADENCE DESIGN SYSTEMS   (United States)

Author keywords

Crosstalk; ECO; Routing

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; ROUTERS; SPURIOUS SIGNAL NOISE; THEOREM PROVING;

CROSSTALK VIOLATION ELIMINATION (CVE); DESIGN PROCESSES; ROUTING;

CROSSTALK;

EID: 2942667853     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/981066.981075     Document Type: Conference Paper

References (5)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows, Prentice Hall, 1993.
2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms, The MIT Press, 1992.
3. T. Sakurai and k. Tamaru. Simple formulas for two and three dimensional capacitance. IEEE Trans. Electron Devices, 1993.
4. H. Xiang, K. Chao, and D.F. Wong. ECO Algorithms for Removing Overlaps between Power Rails and Signal Wires, IEEE/ACM ICCAD, pp 67-74, San Jose, CA, Nov. 2002.
5. H. Zhou and D.F. Wong, Global Routing with Crosstalk Constraints, ACM/IEEE DAC, San Francisco, CA, 1998.