This article is cited in 1 paper

Synthesis of reliable circuits in the basis consisting of the Webb function in $P_k$

M. A. Alekhina^a, O. Yu. Barsukova<sup>b

a</sup> Penza State Technological University, 1a/11 Baidukova pr./Gagarina str., Penza, 440039 Russia
^b Penza State University, 40 Krasnaya str., Penza, 440026 Russia

Abstract: We consider the realization of $k$-meaning logics $(k > 3)$ functions by the circuits from unreliable gates in the complete basis, consisting of the Webb function. We assume that the basic gates pass into faulty states independently of each other and the faults are such that each of the incorrect values appears at the output of the basis gate with the same probability.
Previously we developed methods for the synthesis of reliable circuits for $k \in \{3, 4, 5\}$. In this article we show that for $ k \ge 6$ any $k$-meaning logic functions can be realized by an reliable circuit, we offer two methods of the synthesis of reliable circuits and we make a comparison of the upper bounds for unreliability of constructed circuits, which are obtained with the help of these methods.
The obtained results are valid in the dual (with respect to the permutation generated by the Lukashevich function) basis for the same faults.

Keywords: $k$-meaning logics functions, unreliable functional gates, reliability and unreliability of circuit, synthesis of circuits from unreliable gates, faults at outputs of gates.

UDC: 519.718

Received: 12.06.2018
Revised: 13.09.2018
Accepted: 19.12.2018

DOI: 10.26907/0021-3446-2019-7-15-28

 English version: Russian Mathematics (Izvestiya VUZ. Matematika), 2019, 63:7, 12–23

Bibliographic databases:

• 
•