Skip to main content
Article thumbnail
Location of Repository

Language Reference

By Mr (b: W (c, Fei (prc-tsi-ct) Song, Ming (prc-tsi-ssf) Cheng, Guowu (-prls-ece) Tang and Zhiwei (-prls-ece) Sun


A combinatorial congestion estimation approach with generalized detours. (English summary) Comput. Math. Appl. 51 (2006), no. 6-7, 1113–1126. Summary: “Congestion estimation plays an important role in the physical layout of VLSI design. This paper presents a new probabilistic estimation model that improves the previous estimators by relaxing the constraint on detours in a route. The model is more general and realistic for it gives the flexibility for the wires to have wider usage area to bypass the congestion regions and blockages. Given a routing grid and a set of nets to be routed, the model predicts the routing density on each edge of the grid. The routing density provides direct congestion estimation. We compare our estimation results to the actual routing results. Experimental results show the effectiveness of our estimator.

Publisher: Press
Year: 1997
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.