Abstract
Methods for vector and multiple logical computations are described. An algorithm is presented that allows for parallel computations of the values of the conjunctive terms of generalized polynomial forms using multiple sets of variables. Evaluations of the performance of the proposed algorithm are given. An example of multiple parallel computations of the terms of an arithmetic polynomial is analyzed.
Similar content being viewed by others
References
Sizonenko, A.B., A High-Performance Algorithm for Calculating Conjunctive and Disjunctive Terms in Polynomial Representations of Boolean Functions, Automat. Cont. Comp. Sci., 2012, vol. 46, pp. 147–156.
Lapkin, L.Ya., On Vector Program Realization of Logic Functions, Avtom. Telemekh., 1983, no. 3, pp. 120–128.
Malyugin, V.D., Parallel’nye logicheskie vychisleniya posredstvom arifmeticheskikh polinomov (Parallel Logic Calculations by Arithmetic Polynomials), Moscow: Fizmatlit, 1997.
Shalyto, A.A., Logicheskoe upravlenie. Metody apparatnoi i programmnoi realizatsii algoritmov (Logic Control. Methods of Hardware- and Program-Based Realization of Algorithms), St. Petersburg: Nauka, 2000.
Vykhovanets, V.S. and Malugin, V.D., Multiple Logic Calculations, Automatic and Remote Control, 1998, vol. 59, pp. 885–891.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.B. Sizonenko, 2013, published in Avtomatika i Vychislitel’naya Tekhnika, 2013, No. 1, pp. 23–30.
About this article
Cite this article
Sizonenko, A.B. Multiple parallel computations of terms of generalized polynomial forms of representations of Boolean functions. Aut. Control Comp. Sci. 47, 15–21 (2013). https://doi.org/10.3103/S0146411613010069
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411613010069