17th International Conference on VLSI Design. Proceedings.
DOI: 10.1109/icvd.2004.1261013
|View full text |Cite
|
Sign up to set email alerts
|

Path based approach for crosstalk delay analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…Timing window discreteness was used for pessimism reduction in other papers [5][6][7] as well. Another work [8] considered aggressor noise injection timing against victim signal transition timing window.…”
Section: Introductionmentioning
confidence: 99%
“…Timing window discreteness was used for pessimism reduction in other papers [5][6][7] as well. Another work [8] considered aggressor noise injection timing against victim signal transition timing window.…”
Section: Introductionmentioning
confidence: 99%
“…(a) ( b ) The last constraints to be modified are (4), (7) and (8). Since their transformed functions are all the same type, we just explain it for constraint (4).…”
Section: Proofmentioning
confidence: 99%
“…GBA primarily relies on switching windows (between the minimum and maximum arrival times) of aggressors and victims for crosstalk calculation; even though, actual switching times are discrete. Hence, the timing windows are the major source of pessimism in crosstalk calculation [8].…”
Section: Gate-based Timing Analysismentioning
confidence: 99%
“…Thus the worst case path timing impact for each frequency group may be computed. [8] suggests that summing up the stage pushouts to compute the impact on the path timing is not realistic, and also that for each path, the signal arrival times (for the victims) can be treated as a discrete instead of a window. When multiple frequency groups are considered, we would get one such arrival time for each frequency group.…”
Section: Extension To Crosstalk Delay Analysismentioning
confidence: 99%
“…In equation (8) are correlation factors. If we assumed correlation between all nets in a path to be same, equation (8) can be re-written as,…”
Section: Table 1 Sorted Glitch At Netsmentioning
confidence: 99%