HS: a hierarchical search package for CAD data
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 12 (1), 1-5
- https://doi.org/10.1109/43.184838
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 timeKeywords
This publication has 5 references indexed in Scilit:
- CHAMP: concurrent hierarchical and multilevel program for simulation of VLSI circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Behavioral model synthesis with ConesIEEE Design & Test of Computers, 1988
- Clustering a DAG for CAD databasesIEEE Transactions on Software Engineering, 1988
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Information Management for Engineering DesignPublished by Springer Nature ,1985