• DocumentCode
    1544876
  • Title

    On wirelength estimations for row-based placement

  • Author

    Caldwell, Andrew E. ; Kahng, Andrew B. ; Mantik, Stefanus ; Markov, Igor L. ; Zelikovsky, Alexander

  • Author_Institution
    Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
  • Volume
    18
  • Issue
    9
  • fYear
    1999
  • fDate
    9/1/1999 12:00:00 AM
  • Firstpage
    1265
  • Lastpage
    1278
  • Abstract
    Wirelength estimation in very large scale integration layout is fundamental to any predetailed routing estimate of timing or routability. In this paper, we develop efficient wirelength estimation techniques appropriate for wirelength estimation during top-down floorplanning and placement of cell-based designs. Our methods give accurate, linear-time approaches, typically with sublinear time complexity for dynamic updating of estimates (e.g., for annealing placement). Our techniques offer advantages not only for early on-line wirelength estimation during top-down placement, but also for a posteriori estimation of routed wirelength given a final placement. In developing these new estimators, we have made several contributions, including (1) insight into the contrast between region-based and bounding box-based rectilinear Steiner minimal tree (RStMT) estimation techniques; (2) empirical assessment of the correlations between pin placements of a multipin net that is contained in a block; and (3) new wirelength estimates that are functions of a block´s complexity (number of cell instances) and aspect ratio
  • Keywords
    VLSI; cellular arrays; circuit layout CAD; integrated circuit layout; logic CAD; network routing; trees (mathematics); VLSI layout; a posteriori estimation; annealing placement; aspect ratio; block complexity; bounding box-based; cell-based designs; dynamic updating of estimates; early on-line wirelength estimation; empirical assessment; final placement; linear-time approaches; multipin net; on line algorithms; pin placements; rectilinear Steiner minimal tree; region-based; routability; routed wirelength; row-based placement; standard cell; sublinear time complexity; top-down floorplanning; wirelength estimations; Annealing; Circuit optimization; Computer science; Costs; Design methodology; Routing; Steiner trees; Timing; Very large scale integration; Wiring;
  • fLanguage
    English
  • Journal_Title
    Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0278-0070
  • Type

    jour

  • DOI
    10.1109/43.784119
  • Filename
    784119