• DocumentCode
    831901
  • Title

    HS: a hierarchical search package for CAD data

  • Author

    Parikh, Nishith P. ; Lo, Chi-Yuan ; Singhal, Anoop ; Wu, Kwok W.

  • Author_Institution
    AT&T Bell Labs., Murray Hill, NJ, USA
  • Volume
    12
  • Issue
    1
  • fYear
    1993
  • fDate
    1/1/1993 12:00:00 AM
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    An algorithm that implicitly searches the flattened VLSI netlist data space without first constructing it is presented. In traditional methods, the entire search space of size n (e.g. the total number of instances) is constructed explicitly to allow a fast O(1) query time. The new algorithm uses circuit hierarchy to prune the search effectively. It is shown that the size of a hierarchical netlist is o(n), and a query can be executed in O(1) amortized time
  • Keywords
    VLSI; circuit CAD; search problems; CAD data; HS algorithm; VLSI netlist data space; hierarchical search package; Algorithm design and analysis; Circuit simulation; Data structures; Graphics; Helium; Information retrieval; Packaging; Spatial databases; Very large scale integration; Workstations;
  • 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.184838
  • Filename
    184838
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=831901