Skip to main content
SpringerLink
Log in

Simultaneous calculation of several conjunction terms for generalized polynomial forms of Boolean functions

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

An algorithm for the simultaneous calculation of several conjunction terms of the Zhegalkin (Reed-Muller) polynomial with fixed polarity and an arithmetic polynomial on the same set of variables is proposed. The performance evaluation of the proposed algorithm is presented. An example of the simultaneous calculation of the arithmetic polynomial’s terms is described to demonstrate an increase in the calculation performance.

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. Sizonenko, A.B., A high-performance algorithm for calculating conjunctive and disjunctive terms in polynomial representations of boolean functions, Autom. Control Comput. Sci., 2012, vol. 46, pp. 147–156.

    Article  Google Scholar 

  2. Sizonenko, A.B., Multiple parallel computations of terms of generalized polynomial forms of representations of Boolean functions, Autom. Control Comput. Sci., 2013, vol. 47, pp. 15–21.

    Article  Google Scholar 

  3. Lapkin, L.Ya., On vector programming realization of logic functions, Avtom. Telemekh., 1983, no. 3, pp. 120–128.

    Google Scholar 

  4. Malyugin, V.D., Parallel’nye logicheskie vychisleniya posredstvom arifmeticheskikh polinomov (Parallel logical computations by arithmetical polynomials), Moscow: Nauka. Fizmatlit, 1997.

    MATH  Google Scholar 

  5. Shalyto, A.A., Logicheskoe upravlenie. Metody apparatnoi i programmnoi realizatsii algoritmov (Logical Control. Hardware and Software Algorithm Realization Methods), St. Petersburg: Nauka, 2000.

    Google Scholar 

  6. Vykhovanets, V.S., Multiple logical computations, Avtomatika i Telemekhanika. 1998, no. 6, pp. 163–171.

    Google Scholar 

  7. Fin’ko, O.A., Large systems of Boolean functions: Realization by modular arithmetic methods, Autom. Remote Control, 2004, vol. 65, pp. 871–892.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krasnodar University of the Ministry of Internal Affairs of the Russian Federation, ul. Yaroslavskaya 128, Krasnodar, 350005, Russia

    A. B. Sizonenko

Authors
  1. A. B. Sizonenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. B. Sizonenko.

Additional information

Original Russian Text © A.B. Sizonenko, 2013, published in Avtomatika i Vychislitel’naya Tekhnika, 2013, No. 5, pp. 34–41.

About this article

Cite this article

Sizonenko, A.B. Simultaneous calculation of several conjunction terms for generalized polynomial forms of Boolean functions. Aut. Control Comp. Sci. 47, 248–253 (2013). https://doi.org/10.3103/S0146411613050076

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation