2012
DOI: 10.1016/j.vlsi.2011.03.001
|View full text |Cite
|
Sign up to set email alerts
|

Fast timing analysis of clock networks considering environmental uncertainty

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 28 publications
0
5
0
Order By: Relevance
“…Various techniques have been proposed in the last three decades which try to reduce the test data by appropriately reusing the unspecified bits in the test data. Such techniques can be broadly classified as a) Linear decompressors and broadcast scan-based techniques and b) Code based techniques (Wang et al 2012). The categorization between the two majorly depends upon the fact that the former ones require the structural knowledge of the circuit under test while the code based don't.…”
Section: Analysis Of Existing Literaturementioning
confidence: 99%
“…Various techniques have been proposed in the last three decades which try to reduce the test data by appropriately reusing the unspecified bits in the test data. Such techniques can be broadly classified as a) Linear decompressors and broadcast scan-based techniques and b) Code based techniques (Wang et al 2012). The categorization between the two majorly depends upon the fact that the former ones require the structural knowledge of the circuit under test while the code based don't.…”
Section: Analysis Of Existing Literaturementioning
confidence: 99%
“…), write and read failures D w (w, t w ), write failure only D r (w, t r ), read failure only (11) where D(w, t) is the safety distance and t is the pulse-width for read or write operation. Due to the symmetrical structure, three transistor pairs are used to represent the 6T-SRAM.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Therefore, the clock skew of a clock-tree branch is the sum of skews from all the grids it passes through S = i∈B k S i (24) where S i represents the skew from ith grid among set B k . Based on the derived sensitivity and skew function, a nonlinear optimization can be performed as follows.…”
Section: B Nonlinear Optimizationmentioning
confidence: 99%
“…Based on the derived sensitivity and skew function, a nonlinear optimization can be performed as follows. Substituting (19), (22), and (23) into (24), the clock-tree branch skew S converts to a quadratic function of inserted …”
Section: B Nonlinear Optimizationmentioning
confidence: 99%
See 1 more Smart Citation