Abstract:
The problem of implementing Boolean functions by reliable schemes of unreliable functional elements in the basis $\{x_1 x_2 \vee x_1 x_3 \vee x_2 x_3, x_1 \vee x_2 \vee x_3, x_1 \& x_2 \& x_3, \overline{x}_1\}$ is solved. To solve the problem, two different methods are proposed to increase the reliability of schemes: the first is using a disjunctor and a conjunctor, and the second is using a voting element. Three types of element faults are considered: 1) inverse faults at the inputs of the elements; 2) the same type of constant faults at the outputs of the elements; 3) the same type of constant faults at the inputs of the elements. In each case, the two named methods are used and the obtained estimates of the unreliability of the schemes are compared. It is shown that with the same type of constant faults at the inputs of elements, the use of the voting element (the second method) gives a worse assessment of unreliability than the use of a conjunctor and a disjunctor.