ON LOGIC NETWORKS ALLOWING SHORT SINGLE FAULT DETECTION TESTS UNDER ARBITRARY FAULTS OF GATES
It is proved that one can implement any non-constant Boolean function in n variables by an irredundant logic network in the basis {&, ⊕, ¬}, containing not more than one dummy input variable and allowing a single fault detection test with length not more than 2n + 3 regarding arbitrary faults of logic gates.
Keyword(s):
1978 ◽
Vol 25
(1)
◽
pp. 46-48
◽
Keyword(s):
2015 ◽
Vol 39
(3)
◽
pp. 144-152
◽