Proceedings. XI Brazilian Symposium on Integrated Circuit Design (Cat. No.98EX216)
DOI: 10.1109/sbcci.1998.715443
|View full text |Cite
|
Sign up to set email alerts
|

An improved path enumeration method considering different fall and rise gate delays

Abstract: Most of path enumeration-based timing analysis tools use a single delay per gate for path delay calculation. However, the timing analysis of current submicronic designs demands more accurate delay calculation methods, which can improve path enumeration accuracy and especially, critical delay estimation accuracy. This article presents modifications to the classical bestfirst procedure proposed by Yen and collaborators [1] in order to consider a pair of delays per gate. The increase in the accuracy of path delay… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…The adopted path tracing procedure is an extension of the Best-First Search procedure proposed by Yen et al [11], modified to consider separate fall and rise gate delays [12]. This procedure begins by creating a circuit graph (DAG) and computing the "maximum delay to terminal" (mdt) to each graph node, beginning by nodes that represent the primary outputs.…”
Section: Path Tracingmentioning
confidence: 99%
“…The adopted path tracing procedure is an extension of the Best-First Search procedure proposed by Yen et al [11], modified to consider separate fall and rise gate delays [12]. This procedure begins by creating a circuit graph (DAG) and computing the "maximum delay to terminal" (mdt) to each graph node, beginning by nodes that represent the primary outputs.…”
Section: Path Tracingmentioning
confidence: 99%
“…The used path tracing procedure is an extension of the Best-First Search procedure proposed by Yen et al [11], modified to consider separate fall and rise gate delays [12]. This procedure begins by creating a circuit graph (DAG) and computing the "maximum delay to terminal" (mdt) to each graph node, beginning by nodes that represent the primary outputs.…”
Section: Path Tracingmentioning
confidence: 99%