Skip to main content
Log in

On the circuits reliability in “anticonjunction” basis with constant faults at gate inputs

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

We consider the implementation of Boolean functions by circuits consisting of unreliable functional gates in the basis which contains only anticonjunction. We assume that each circuit gate is exposed to the faults of type 0 or type 1 at the inputs. The circuits are constructed for all Boolean functions and the upper bound of their unreliability is found which depends only on the probabilities of appearance of type 0 fault and type 1 fault at the gate inputs. We also prove that the found upper bound of the circuits unreliability is asymptotically (for small values of probability) equals the lower bound of the unreliability for almost all Boolean functions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. von Neuman, J. Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components, Ed. by C. Shannon and J.Mc. Carthy (Princeton University Press, 1956), pp. 432–98.

    Google Scholar 

  2. Ortyukov, S. I. “On the Redundancy of the Realization ofBoolean Functions by Circuits of UnreliableGates”, in Proceedings of the Seminar on Discrete Mathematics and its Appslications, Moscow, January 27–29, 1987 (Moscow Univ. Press, Moscow, 1989) pp. 1662–168.

    Google Scholar 

  3. Uhlig, D. “Reliable Networks from Unreliable Gates with Almost Minimal Comlexity”, in Proceeding of Intern. Conf. ‘Fundamentals of Computation Theory’, Kazan, June 1987 (Springer-Verlag, Berlin, 1987), pp. 4622–469.

    Google Scholar 

  4. Alekhina, M. A. “Synthesis, Reliability and Complexity of Schemes from Unreliable Functional Gates”, Candidate’s Dissertation in and Mathematics and Physics (Penza, 2004).

    Google Scholar 

  5. Alekhina, M. A. “Lower Bounds for Unreliability of Networks in Some Bases Under Single-Type Faults at the Input of Elements”, Diskretn. Anal. Issled. Oper., Ser. 1 9, No. 3, 3–28 (2002) [in Russian].

    MathSciNet  MATH  Google Scholar 

  6. Alekhina, M. A. “Synthesis and Complexity of Reliable Circuits Consisting of Unreliable Gates”,Mat. Vopr. Kibern., No. 11, 193–218 (2002) [in Russian].

    MathSciNet  MATH  Google Scholar 

  7. Alekhina, M. A. “On the Reliability and Complexity of Circuits in the Basis x | y with Inverse Faults at the Inputs of Gates”, Izv. VUZ. Povolzhskii Region. Estestv. Nauki, No. 6 (21), 36–41 (2005) [in Russian].

    Google Scholar 

  8. Chugunova, V. V. “Synthesis of AsymptoticallyOptimal Circuits on Reliability at Inverse Faults at the Inputs of Gates”, Candidate’s Dissertation in Mathematics and Physics (Penza, 2007).

    Google Scholar 

  9. Alekhina, M.A. “Reliability and Ccomplexity of Schemes in the Basis {x|y} with Inverse Faults of Elements”, Diskretn. Anal. Issled. Oper., Ser. 1 12, No. 2, 3–11 (2005) [in Russian].

    MathSciNet  MATH  Google Scholar 

  10. Alekhina, M. A., Vasin, A. V. “Sufficient Conditions for Realizability of Boolean Functions by Asymptotically Optimal Circuits with the Unreliability 2ε”, RussianMathematics (Iz. VUZ) 54, No. 5, 68–70 (2010).

    MathSciNet  MATH  Google Scholar 

  11. Alekhina, M. A. “Synthesis and Complexity of Asymptotically Optimal Circuits with Unreliable Gates”, Fundam. Inform. 104, No. 3, 219–225 (2010).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. A. Alekhina.

Additional information

Original Russian Text © M.A. Alekhina, V.V. Kurysheva, 2016, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, No. 7, pp. 3–9.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alekhina, M.A., Kurysheva, V.V. On the circuits reliability in “anticonjunction” basis with constant faults at gate inputs. Russ Math. 60, 1–6 (2016). https://doi.org/10.3103/S1066369X1607001X

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X1607001X

Keywords

Navigation