Upper Bound of the Circuits Unreliability in a Complete Finite Basis (in P3) with Arbitrary Faults of Elements

Abstract

In this paper it is considered the implementation of ternary logic functions by the circuits of unreliable functional elements in an arbitrary complete finite basis. It is assumed that all the circuit elements pass to fault states independently of each other, and the faults can be arbitrary (for example, inverse or constant). Previously known class of ternary logic functions is extended, the circuits of these functions can be used to raise the reliability of the original circuits. With inverse faults at the outputs of basis elements it is constructively proved using functions of this class (we denote by G it) that a function which differs from any one of the variables can be implemented by a reliable circuit, and the probability of the inverse fault is bounded above by a constant. In particular if the basis under consideration contains at least one of the class G functions then for any function which differs from any one of the variables the constructed circuit is not only reliable, but this one is asymptotically optimal by reliability (we remind that function which is equal to one of the variables can be implemented absolutely reliably, not using functional element).