Abstract
Abstract We identify the classes of Boolean functions that may be implemented by easily testable circuits in the Zhegalkin basis for constant type-1 faults on outputs of gates. An upper estimate for the length of a complete fault detection test for three-place functions is obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have