Issue No. 11 - November (1973 vol. 22)

ISSN: 0018-9340

pp: 1016-1020

S.M. Reddy , Department of Electrical Engineering, University Iowa

ABSTRACT

The problem of designing fault detecting test sets from the functional description rather than the structural description of the networks realizing the logic function is studied. The concept of an expanded truth table for logic functions is introduced. It is proved that the set of minimal true vertices and maximal false vertices of the expanded truth table constitutes a test set to detect any number of stuck-at-faults in a network belonging to a class of restricted networks, called unate gate networks. It is further indicated that even in the presence of redundancies in the network, the test sets given remain valid.

INDEX TERMS

Complete test sets, expanded truth table, fault detecting test sets, logic networks, multiple stuck-at-faults, restricted gate networks, stuck-at-faults, unate gate networks.

CITATION

S. Reddy, "Complete Test Sets for Logic Functions," in

*IEEE Transactions on Computers*, vol. 22, no. , pp. 1016-1020, 1973.

doi:10.1109/T-C.1973.223638

CITATIONS

SEARCH