Abstract
The paper is concerned with the problems of repair check and diagnosis of states of N logic gates that realize, in working condition, a given Boolean function f(x1, . . . , xn). This problem is attacked by composing single-output circuits from the given logic gates and then observing the values produced by these circuits on various arbitrary input families of values of the variables. Arbitrary constant faults at the outputs of logic gates are admissible.Moreover, it is assumed that at most k gates are faulty, where k is a given natural number not exceeding N. It is required to minimize the number of circuits used to check the repair status and determine the states of all logic gates. It is proved that if f ∉ {x1& . . .&xn, x1V.. . ..Vxn, x̅1} and if k and N satisfy some condition, then 2k + 1 circuits are capable of checking the repair status of all the gates. If, additionally, the function f is nonlinear, then 2k + 1 circuits are sufficient to diagnose the states of all the gates.
© 2014 by Walter de Gruyter Berlin/Boston
Artikel in diesem Heft
- Frontmatter
- Order of power of planar circuits implementing Boolean functions
- Automata generated p-languages
- Fault detection and diagnostic tests for logic gates
- Method of synthesis of easily testable circuits admitting single fault detection tests of constant length
- Characteristic submodules of injective modules over strongly prime rings
Artikel in diesem Heft
- Frontmatter
- Order of power of planar circuits implementing Boolean functions
- Automata generated p-languages
- Fault detection and diagnostic tests for logic gates
- Method of synthesis of easily testable circuits admitting single fault detection tests of constant length
- Characteristic submodules of injective modules over strongly prime rings