Some classes of easily testable circuits in the Zhegalkin basis

Yulia V. Borodina · Discrete Mathematics and Applications · 2023

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.

Read the paper · More papers on PaperTik