This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Closedness and Test Complexity of Logic Circuits
August 1981 (vol. 30 no. 8)
pp. 556-562
H. Fujiwara, Faculty of Engineering, University of Waterloo
The concept of closedness of a set of logic functions under stuck-type faults is introduced. All sets of logic functions closed under stuck-type faults are classified. For the sets of logic functions closed under stuck-type faults, the test complexity and the universal test sets are considered. It is shown that for each class of linear functions, OR functions, and AND functions, both the minimum numbers of multiple fault detection tests and multiple fault location tests are exactly n + 1, where n is the number of inputs of the circuits, and that there exists universal test sets with n + 1 tests to detect and locate all multiple faults in such circuits.
Index Terms:
universal test sets, Closed classes, fault diagnosis, logic functions, stuck faults, test complexity
Citation:
H. Fujiwara, "On Closedness and Test Complexity of Logic Circuits," IEEE Transactions on Computers, vol. 30, no. 8, pp. 556-562, Aug. 1981, doi:10.1109/TC.1981.1675840
Usage of this product signifies your acceptance of the Terms of Use.