Path sensitization in critical path problem

Chen, H.-C.; Du, David H. C.

doi:10.1109/iccad.1991.185233

Cited by 157 publications

(116 citation statements)

References 6 publications

Supporting

Mentioning

115

Contrasting

Order By: Relevance

“…There still remain a few problems on the statistical static timing analysis, among which one of the most important issues is the deletion of false paths [12]. We are tackling this problem by using the proposed technique.…”

Section: Discussionmentioning

confidence: 99%

A statistical static timing analysis considering correlations between delays

Tsukiyama

Tanaka

Fukui

2001

Proceedings of the 2001 Conference on Asia South Pacific Design Automation - ASP-DAC '01

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

A statistical static timing analysis considering correlations between delays

Tsukiyama

Tanaka

Fukui

2001

Proceedings of the 2001 Conference on Asia South Pacific Design Automation - ASP-DAC '01

View full text Add to dashboard Cite

“…We generate a large number of instances. For each generated instance, we use our timing analyzer [10] to identify the longest sensitizable path and calculate the propagation delay along that path. This number is referred as the delay of the instance.…”

Section: An Experimentsmentioning

confidence: 99%

Generation of high quality non-robust tests for path delay faults

Cheng

Chen

1994

Proceedings of the 31st Annual Conference on Design Automation Conference - DAC '94

View full text Add to dashboard Cite

-Earlier research results have shown that for many designs, a large portion of path delay faults is not robustly testable. In this paper, we investigate the test strategy for the non-robustly testable faults. We first present some experimental results to show that the quality of a non-robust test set may be very poor in detecting small delay defects caused by manufacturing process variation. We further show that a better set of non-robust tests can be obtained by including timing information in test generation. A good non-robust test can tolerate a larger timing variation on the off-inputs of the path than a poor test. An algorithm for generating such better quality non-robust tests is presented. We present experimental results to compare quality of non-robust test sets with and without using our method. We also present an algorithm, as well as experimental results, for generating validatable non-robust tests.

show abstract

“…The reader is referred to [10] for a formal proof. An interesting observation is that the floating-mode condition, which is commonly used in the literature [2,3], does not produce correct timing models with AdvChar; this is demonstrated in [10].…”

Section: The Advchar Methodsmentioning

confidence: 99%

“…Unfortunately, detecting false paths is difficult, and requires making use of circuit functionality. A full-fledged functional analysis, using any of the existing path propagation conditions [1][2][3]5,7], can be computationally expensive. For instance, the approach by Kukimoto and Brayton [4] can in fact detect all false paths as it calculates I/O delays accurately for each input vector.…”

Section: Introductionmentioning

confidence: 99%