loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Test Conference 2002 (ITC'02)
A New Algorithm for Global Fault Collapsing into Equivalence and Dominance Sets
Baltimore, MD, USA
October 07-October 10
ISBN: 0-7803-7543-2
A.V.S.S. Prasad, Agere Systems
Vishwani D. Agrawal, Agere Systems
Madhusudan V. Atre, Agere Systems
Nodes in a dominance graph represent faults of a circuit. A Directed edge from node f_i to node f_j means that fault f_j dominates f_j. The equivalence of faults f_i and f_j is indicated by the presence of simultaneous edges f_i \to f_j and f_j \to f_i. When local dominance and equivalence relations are included in this graph, its transitive closure provides the collapsed fault sets. Pre-collapsed fault sets of standard cells and other logic blocks can be stored in a graph library for hierarchical fault collapsing. Examples show how more compact fault sets are obtained by using functional equivalences that can be found by analysis of small cells. Benchmark circuits c432 and c499 are used to illustrate the use of functional fault collapsing within their exclusive-OR cells.
Citation:
A.V.S.S. Prasad, Vishwani D. Agrawal, Madhusudan V. Atre, "A New Algorithm for Global Fault Collapsing into Equivalence and Dominance Sets," itc, pp.391, International Test Conference 2002 (ITC'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.