180 likes | 282 Views
Towards Global Routing with RLC Crosstalk Constraints. J. D. Z. Ma, L. He DAC 2002. Outline. Introduction Noise model Algorithm Experiments Conclusion. Global routing. Over-the-cell routing 2 layers, vertical / horizontal. t 2. s. t 1. t 3. Steiner tree. Inductive coupling model.
E N D
Towards Global Routing with RLC Crosstalk Constraints J. D. Z. Ma, L. He DAC 2002
Outline • Introduction • Noise model • Algorithm • Experiments • Conclusion
Global routing • Over-the-cell routing • 2 layers, vertical / horizontal
t2 s t1 t3 Steiner tree
LSK model • Length-scaled Keff • SPICE simulation • 10%~20% noise • Table lookup (LSK vs. noise volt)
Algorithm • Phase 1 • Derive crosstalk bound • Global routing • Phase 2 • SINO • Phase 3 • Violation, congestion removal
Phase 1 – crosstalk bound • Determine LSK • Derive Kth for each net segment • Kth is the max bound of the path
Adjacency graph model t2 s t1 t3
Shield estimation • # of shield is proportional to sensitivity
Phase 2 – SINO • SINO/GC – graph coloring • SINO/SA – simulated annealing • Discussed in previous presentation
Shield insertion Shield removal Phase 3
Experiments • ID+NO • iSINO • GSINO
Conclusion • Global routing infrastructure • 3 phases approach • # of shields estimation • More info will be in TVLSI • Reroute technique seems to be weak