1991, Proceedings. International Test Conference
DOI: 10.1109/test.1991.519507
|View full text |Cite
|
Sign up to set email alerts
|

The Best Flip-Flops to Scan

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 75 publications
(17 citation statements)
references
References 15 publications
0
15
0
Order By: Relevance
“…Transitions at the output of unblockable gates cannot be blocked by assigning any combination of binary values to primary inputs. Uncontrollable gates are identified by performing uncontrollability analysis [13]. The analysis starts by assigning all scan inputs to , where the assignment of assigned to a line denotes that the line is uncontrollable to 1 (0) [13].…”
Section: ) Expanding the Definition Of Conflict-free Assignmentmentioning
confidence: 99%
See 1 more Smart Citation
“…Transitions at the output of unblockable gates cannot be blocked by assigning any combination of binary values to primary inputs. Uncontrollable gates are identified by performing uncontrollability analysis [13]. The analysis starts by assigning all scan inputs to , where the assignment of assigned to a line denotes that the line is uncontrollable to 1 (0) [13].…”
Section: ) Expanding the Definition Of Conflict-free Assignmentmentioning
confidence: 99%
“…Uncontrollable gates are identified by performing uncontrollability analysis [13]. The analysis starts by assigning all scan inputs to , where the assignment of assigned to a line denotes that the line is uncontrollable to 1 (0) [13]. Next these values are propagated to all internal lines according to the propagation rules defined in [13].…”
Section: ) Expanding the Definition Of Conflict-free Assignmentmentioning
confidence: 99%
“…For every stem s, FIRE determines the sets of faults S 0 and S 1 , which require, respectively, s = 0 and s = 1 as necessary conditions for their detection. This is accomplished using an improved version of the uncontrollability and unobservability analysis proposed in [22] . In this analysis, 0 (1) denotes the status of a line that is uncontrollable for value 0 (1).…”
Section: The Combinational Fire Algorithmmentioning
confidence: 99%
“…Because the conditions for S x , S y and S z cannot be satisfied simultaneously, faults in S xyz = S x T S y T S z are redundant. The faults that belong to S x can be found by uncontrollability and unobservability analysis [1,2,3]. Let 0(1) denote the status of a line that is uncontrollable to value 0(1).…”
Section: Identifying Combinational Redundancymentioning
confidence: 99%