LAST: a layout area and shape function estimator for high level applications
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 351-355
- https://doi.org/10.1109/edac.1991.206423
Abstract
We address the problem of area prediction of VLSI layouts. We present an approach based on two models, analytical and constructive. A circuit design is recursively partitioned down to a level specified by the user, thus generating a slicing tree. An analytical model is then used to predict the shape functions of the leaf subcircuits. By traversing the tree bottom up the shape function of the entire layout design can then be constructively predicted. This approach permits the user to trade off the accuracy of the prediction versus the runtime of the predictor. Such a scheme is quite useful for high-level synthesis and system level partitioning. The experimental validation results are quite good, indicating an average error of the order of 5% in predicting shape functions for Standard Cell benchmark designs with sizes ranging from 125 to 12,000 cells.Keywords
This publication has 12 references indexed in Scilit:
- Interconnection length estimation for optimized standard cell layoutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A new area and shape function estimation technique for VLSI layoutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An intelligent component database for behavioral synthesisPublished by Association for Computing Machinery (ACM) ,1990
- Average interconnection length and interconnection distribution based on rent's rulePublished by Association for Computing Machinery (ACM) ,1989
- Techniques for area estimation of VLSI layoutsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- CHAMP: Chip Floor Plan for Hierarchical VLSI Layout DesignIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- An Improved Min-Cut Algonthm for Partitioning VLSI NetworksIEEE Transactions on Computers, 1984
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Connectivity of Random LogicIEEE Transactions on Computers, 1982
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970