System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Timing analysis with implicitly specified false paths

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Goldberg, E. ; Cadence Berkeley Labs., CA, USA ; Saldanha, A.

We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each node one has to store the number of delays which is proportional to that of false paths going through the node. We propose a reduction technique that allows one to drastically reduce the number of delays to store. In particular the technique can be applied when false paths are implicitly specified by a set of through-path exceptions or false sub-graphs. In addition, we introduce a new data structure for representing false paths called abstract false graphs which are as expressive as false sub-graphs but are as compact as through-path exceptions. A preliminary prototype implementation illustrates the potential benefits of our reduction technique by showing up to exponential reduction in memory usage and run-time over previous work

Published in:

VLSI Design, 2000. Thirteenth International Conference on

Date of Conference:

2000