Upper estimate of unreliability of schemes in full finite basis (in P 2) for arbitrary faults of gates

M. A. Alekhina, Yu. S. Gusynina, T. A. Shornikova · Russian Mathematics · 2017

We consider the realization of Boolean functions by circuits with unreliable functional gates in a complete finite basis. We assume that each gate of the circuit is exposed to arbitrarily faults, and the gates faults are statistically independent. We construct the circuits for all Boolean functions and get their upper bound of the unreliability, which depends on the “worst” (the most unreliable) of the basic gate.

Read the paper · More papers on PaperTik