This Article 
 Bibliographic References 
 Add to: 
On the Impossible Class of Faulty Functions in Logic Networks Under Short Circuit Faults
January 1986 (vol. 35 no. 1)
pp. 85-90
B.B. Bhattacharya, Indian Statistical Institute
The important problem of recognizing a priori the class of Boolean functions which are never obtainable from a given combinational network under short circuit faults is almost unexplored, primarily due to lack of understanding of the functional and structural factors that influence the fault behavior in the network. In view of this, a new concept of impossible class of faulty functions (ICFF) is introduced in this correspondence. Several intriguing properties of ICFF are uncovered, namely, the undetectability of input bridging faults, the impossibility of the transformation of a fault free function Fo to a subset or superset of Fo, and to other functions belonging to the same P-and N-equivalence classes of Fo, etc. The closure amongst the fan-out-free and unate functions under bridging faults is investigated. The impact of ICFF on the testability of the network is also discussed.
Index Terms:
unate functions, Bridging faults, combinational logic, fan-out-free functions, fault detection, N-equivalence classes, P-equivalence classes, short circuit faults, stuck-at faults
B.B. Bhattacharya, B. Gupta, "On the Impossible Class of Faulty Functions in Logic Networks Under Short Circuit Faults," IEEE Transactions on Computers, vol. 35, no. 1, pp. 85-90, Jan. 1986, doi:10.1109/TC.1986.1676666
Usage of this product signifies your acceptance of the Terms of Use.