Approximate timing analysis of combinational circuits under the XBD0 model

Authors:
Yuji Kukimoto;Wilsin Gosti;Alexander Saldanha;Robert K. Brayton
Affiliations:
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA;Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA;Department of Electrical Engineering and Computer Sciences, Cadence Berkeley Laboratories, Berkeley, CA;Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA
Venue:
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 4
Cited 6

A polynomial-time heuristic approach to approximate a solution to the false path problem

DAC '93 Proceedings of the 30th international Design Automation Conference
Hierarchical timing analysis using conditional delays

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
An approximate timing analysis method for datapath circuits

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Integrating Functional and Temporal Domains in Logic Design: The False Path Problem and Its Implications

Integrating Functional and Temporal Domains in Logic Design: The False Path Problem and Its Implications

Functional timing analysis for IP characterization

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Removing user specified false paths from timing graphs

Proceedings of the 37th Annual Design Automation Conference
Slope propagation in static timing analysis

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Unveiling the ISCAS-85 Benchmarks: A Case Study in Reverse Engineering

IEEE Design & Test
VSPEC constraints modeling and evaluation

ECBS'99 Proceedings of the 1999 IEEE conference on Engineering of computer-based systems
On hierarchical statistical static timing analysis

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90's efficient tools exist which can analyze circuits of thousands of gates in a few minutes or even in seconds for many cases. However, the computation time of these tools is not so predictable since the internal engine of the analysis is either a SAT solver or a modified ATPG algorithm, both of which are just heuristic algorithms for an NP-complete problem. Although they are highly tuned for CAD applications, there exists a class of problem instances which exhibits the worst-case exponential CPU time behavior. In the context of timing analysis, circuits with a high amount of reconvergence, e.g. C6288 of the ISCAS benchmark suite, are known to be difficult to analyze under sophisticated delay models even with state-of-the-art techniques. For example [McGeer93] could not complete the analysis of C6288 under the mapped delay model. To make timing analysis of such corner case circuits feasible we propose an approximate computation scheme to the timing analysis problem as an extension to the exact analysis method proposed in [McGeer93]. Sensitization conditions are conservatively approximated in a selective fashion so that the size of SAT problems solved during analysis is controlled. Experimental results show that the approximation technique is effective in reducing the total analysis time without losing accuracy for the case where the exact approach takes much time or cannot complete.