Skip to main content
SpringerLink
Log in

Partitioning the full range of boolean functions based on the threshold and threshold relation

  • NEW MEANS OF CYBERNETICS, INFORMATICS, COMPUTER ENGINEERING, AND SYSTEMS ANALYSIS
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

An algorithm for the partition of the range of Boolean functions based on the specified threshold value and relation is considered. The algorithm is implemented by means of the PLD-based automatically adjustable structure. The correctness of such an implementation is proved and some of the applications are considered.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Estrin, “Organization of computer system: The fixed plus variable structure computer,” Proc. Western Joint Computer Conf., No. 5, 33–40 (1960).

  2. A. V. Palagin and V. N. Opanasenko, “Reconfigurable-computing technology,” Cybern. Syst. Analysis, 43, No. 5, 675–686 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  3. A. V. Palagin and V. N. Opanasenko, Reconfigurable Computing Systems [in Russian], Prosvita, Kyiv (2006).

    Google Scholar 

  4. Yu. L. Vasil’ev, F. Ya. Vetukhnovskii, V. V.Glagolev, Yu. I. Zhuravlyov, et al., Discrete Mathematics and Mathematical Problems of Cybernetics [in Russian], Nauka, Moscow (1971).

    Google Scholar 

  5. G. Birkhoff and T. Bartee, Modern Applied Algebra, McGraw-Hill, New York (1970).

    MATH  Google Scholar 

  6. N. N. Kussul, “Neural networks training using method of fuzzy ellipsoidal estimates,” J. Autom. Inform. Sci., Vol. 33, Issue 3 (2001).

    Google Scholar 

  7. N. M. Kussul’, A. Yu. Shelestov, and A. M. Lavrenyuk, Intelligent Computing [in Russian], Naukova Dumka, Kyiv (2006).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V.M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    V. N. Opanasenko

  2. Taras Shevchenko National University of Kyiv, Kyiv, Ukraine

    S. L. Kryvyi

Authors
  1. V. N. Opanasenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. L. Kryvyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. N. Opanasenko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2012, pp. 163–173.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Opanasenko, V.N., Kryvyi, S.L. Partitioning the full range of boolean functions based on the threshold and threshold relation. Cybern Syst Anal 48, 459–468 (2012). https://doi.org/10.1007/s10559-012-9425-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-012-9425-8

Keywords

Search

Navigation