1 / 18

Global Routing with RLC Crosstalk Constraints: A Three-Phase Approach

This paper discusses a novel approach to global routing that incorporates RLC crosstalk constraints. It presents a comprehensive noise model and a multi-phased algorithm designed to minimize crosstalk in complex routing scenarios. The method includes inductive coupling modeling, SPICE simulation, and various optimization techniques such as graph coloring and simulated annealing. Experimental results demonstrate its effectiveness in reducing crosstalk violations while managing wire length and area overhead. This innovative framework is essential for enhancing routing performance in advanced integrated circuits.

bertha
Télécharger la présentation

Global Routing with RLC Crosstalk Constraints: A Three-Phase Approach

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Towards Global Routing with RLC Crosstalk Constraints J. D. Z. Ma, L. He DAC 2002

  2. Outline • Introduction • Noise model • Algorithm • Experiments • Conclusion

  3. Global routing • Over-the-cell routing • 2 layers, vertical / horizontal

  4. t2 s t1 t3 Steiner tree

  5. Inductive coupling model

  6. LSK model • Length-scaled Keff • SPICE simulation • 10%~20% noise • Table lookup (LSK vs. noise volt)

  7. Algorithm • Phase 1 • Derive crosstalk bound • Global routing • Phase 2 • SINO • Phase 3 • Violation, congestion removal

  8. Phase 1 – crosstalk bound • Determine LSK • Derive Kth for each net segment • Kth is the max bound of the path

  9. Adjacency graph model t2 s t1 t3

  10. Iterative deletion algorithm

  11. Shield estimation • # of shield is proportional to sensitivity

  12. Phase 2 – SINO • SINO/GC – graph coloring • SINO/SA – simulated annealing • Discussed in previous presentation

  13. Shield insertion Shield removal Phase 3

  14. Experiments • ID+NO • iSINO • GSINO

  15. Crosstalk violation ratio

  16. Wire length overhead

  17. Area overhead

  18. Conclusion • Global routing infrastructure • 3 phases approach • # of shields estimation • More info will be in TVLSI • Reroute technique seems to be weak

More Related