Accurate prediction of physical design characteristics for random logic
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 100-108
- https://doi.org/10.1109/iccd.1989.63337
Abstract
An accurate model is presented for the prediction of physical design characteristics, such as interconnection lengths and layout areas, for standard cell layouts. This model produces accurate shape constraint functions (height versus width of the layout over a range of aspect ratios) by considering the logic design specification, the physical design process, and the physical implementation technology. Random and optimized placements, global and detailed routing are each abstracted by procedural models that capture the important features of these processes. Equations that define the procedure model are presented. Predictions of layout characteristics that are within 10% of the actual layouts are achieved over a range of circuit functions and sizes. The authors have verified both the global characteristics (total interconnection length and layout area) and the detailed characteristics (wire length and feedthrough distributions) of the model. Accurate prediction of physical design characteristics is useful for floorplanning, evaluating the fit of a logic design to a fabrication technology, and studying placement algorithms.Keywords
This publication has 14 references indexed in Scilit:
- Interconnection length estimation for optimized standard cell layoutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A new algorithm for standard cell global routingIntegration, 1992
- Techniques for area estimation of VLSI layoutsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Prediction of wiring space requirements for LSIPublished by Association for Computing Machinery (ACM) ,1988
- Benchmarks for cell-based layout systemsPublished by Association for Computing Machinery (ACM) ,1987
- Stochastic Models for Wireability Analysis of Gate ArraysIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- The largest minimal rectilinear steiner trees for a set ofn points enclosed in a rectangle with given perimeterNetworks, 1979
- A “Dogleg” channel routerPublished by Association for Computing Machinery (ACM) ,1976
- On a Pin Versus Block Relationship For Partitions of Logic GraphsIEEE Transactions on Computers, 1971
- Wire routing by optimizing channel assignment within large aperturesPublished by Association for Computing Machinery (ACM) ,1971