This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Recursive Coverage Projection of Test Sets
November 1979 (vol. 28 no. 11)
pp. 865-870
V.K. Agarwal, Department of Electrical Engineering, McGill University
In the generation of test sets for the detection of stuck-type faults in combinational switching networks, it is an expedient and reasonably common assumption to consider explicitly faults only of specified sizes (for example, all single faults), and then to assume (or hope) that most or all faults of larger sizes will be covered (that is, detected) as well. This paper systematically addresses this aspect of multiple fault coverage in a quantitative manner for combinational networks, wherein only primary input fanout is allowed. A procedure is given to estimate (or project) the multiple fault coverage capability of a test set based on the known coverage capability of that test set for subsets of the multiple faults. This is accomplished by means of a recursive use of a detailed formula which exploits two fundamental interrelationships between test sets and faults. Based upon these results, it can be shown that the above-mentioned assumption must be made, in general, with discretion as its validity is highly network structure/test set dependent.
Index Terms:
recursive projection, Consistency, coverage, fault detection, internal fanout-free networks, multiple faults
Citation:
V.K. Agarwal, G.M. Masson, "Recursive Coverage Projection of Test Sets," IEEE Transactions on Computers, vol. 28, no. 11, pp. 865-870, Nov. 1979, doi:10.1109/TC.1979.1675268
Usage of this product signifies your acceptance of the Terms of Use.