Easily testable circuits in Zhegalkin basis in the case of constant faults of type “1” at gate outputs

Yulia V. Borodina · Discrete Mathematics and Applications · 2020

Abstract We consider Boolean circuits in Zhegalkin basis and describe all Boolean functions that can be implemented by a circuit admitting a complete fault detection test of length 1 in case of constant faults of type “1” at gate outputs.

Read the paper · More papers on PaperTik