Paper Info
Title
Testability analysis of synchronous sequential circuits based on structural data
Abstract
Test sequence length is an effective measure of testability of a sequential circuit. The lower the bound on the length, the more testable the circuit is. A graph-theoretic approach is used to compute the bound on test sequence length for any sequential circuit. The condensation of the graph is found by collapsing the strongly connected components into single nodes. By analyzing each stem region, it is possible to compute the bound on test sequence length for the entire circuit. The time complexity of the procedure is O(n2), where n is the number of nodes in the circuit graph. The bounds of the individual submachines can be used in test generation, scan design, and built-in self-test design. Three design rules are specified to yield circuits with lower test sequence bounds
Year
DOI
Venue
1989
10.1109/TEST.1989.82320
Washington, DC
Keywords
Field
DocType
graph theory,logic testing,sequential circuits,built-in self-test design,scan design,structural data,submachines,synchronous sequential circuits,test generation,test sequence length,testability,time complexity
Testability,Automatic test pattern generation,Sequential logic,Computer science,Algorithm,Scan chain,Electronic engineering,Electronic circuit,Time complexity,Strongly connected component,Asynchronous circuit
Conference
Citations 
PageRank 
References 
10
10.33
7
Authors
2
Name
Order
Citations
PageRank
Raghu V. Hudli11010.33
Sharad C. Seth267193.61