Abstract:
It is proved that any Boolean function can be implemented by a logic network in the basis {x&y&z,x⊕y,1} in such a way that this logic network admits a complete diagnostic test of length at most 2 with respect to inverse faults at the outputs of logic gates.
This publication is cited in the following 4 articles:
K. A. Popkov, “Short Complete Diagnostic Tests for Circuits Implementing Linear Boolean Functions”, Math. Notes, 113:1 (2023), 80–92
K. A. Popkov, “On Self-Correcting Logic Circuits of Unreliable Gates with at Most Two Inputs”, Math. Notes, 111:1 (2022), 157–160
I. G. Lyubich, D. S. Romanov, “Single diagnostic tests for inversion faults of gates in circuits over arbitrary bases”, Discrete Math. Appl., 32:1 (2022), 1–9
I. G. Lyubich, D. S. Romanov, “Single Fault Diagnostic Tests for Inversion Faults of Circuit Elements Over Some Bases”, Comput Math Model, 30:1 (2019), 36