| Hierarchical functional timing analysis |
| Full text |
Pdf
(239 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 35th annual Design Automation Conference
table of contents
San Francisco, California, United States
Pages: 580 - 585
Year of Publication: 1998
ISBN:0-89791-964-5
|
|
Authors
|
|
Yuji Kukimoto
|
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA
|
|
Robert K. Brayton
|
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 11, Citation Count: 5
|
|
|
ABSTRACT
We propose a hierarchical timing analysis technique for combinational circuits under the tightest known sensitization criterion, the XBDO delay model. Given a hierarchical combinational circuit, a generalized delay model of each left module is characterized first. Since this timing characterization step takes into account false paths in each module, the delay model is more accurate than the one obtained by topological analysis. Then topological delay analysis is performed on the circuit composed of generalized gates replacing the leaf modules, where the “gate” delay model is the derived one. As far as the authors know, this is the first result that shows that hierarchical analysis is possible under state-of-the-art tight sensitization criteria. We demonstrate by experimental results that loss of accuracy in using the hierarchical approach is very minimal in practice. The theory developed in this paper also provides a foundation for incremental timing analysis under accurate sensitization criteria.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
H.-C. Chen and D. H.-C. Du. Path sensitization in critical path problem. IEEE Transactions on Computer-Aided Design, 12(2): 196-207, February 1993.
|
| |
3
|
S. Devadas, K. Keutzer, and S. Malik. Computation of floating mode delay in combinational circuits: Theory and algorithms. 1EEE Transactions on Computer-Aided Design, 12( 12): 1913- 1923, December 1993.
|
 |
4
|
|
| |
5
|
|
| |
6
|
P. C. McGeer, A. Saldanha, R. K.Brayton, and A. Sangiovanni- Vincentelli. Delay models and exact timing analysis. In T. Sasao, editor, Logic Synthesis and Optimization, pages 167- 189. Kluwer Academic Publishers, 1993.
|
| |
7
|
A. Saldanha. Performance and testability interactions in logic synthesis. Technical ReportUCB/ERLM91/100, University of California, Berkeley, October 199 1.
|
| |
8
|
S. V. Venkatesh, R. Palermo, M. Mortazavi, and K. A. Sakallah. Timing abstraction of intellectual property blocks. InProceedings of Custom Integrated Circuit Conference,pages 99-102, May 1997.
|
| |
9
|
|
CITED BY 5
|
|
David Blaauw , Rajendran Panda , Abhijit Das, Removing user specified false paths from timing graphs, Proceedings of the 37th conference on Design automation, p.270-273, June 05-09, 2000, Los Angeles, California, United States
|
|
|
Hakan Yalcin , Mohammad Mortazavi , Robert Palermo , Cyrus Bamji , Karem Sakallah, Functional timing analysis for IP characterization, Proceedings of the 36th ACM/IEEE conference on Design automation, p.731-736, June 21-25, 1999, New Orleans, Louisiana, United States
|
|
|
|
|
|
Wilsin Gosti , Amit Narayan , Robert K. Brayton , Alberto L. Sangiovanni-Vincentelli, Wireplanning in logic synthesis, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.26-33, November 08-12, 1998, San Jose, California, United States
|
|
|
Mike Hutton , David Karchmer , Bryan Archell , Jason Govig, Efficient static timing analysis and applications using edge masks, Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays, February 20-22, 2005, Monterey, California, USA
|
|