Abstract
Two canonical polynomial representations of Boolean functions are introduced: polynomial perfect normal form and polynomial derivative positive form in the Boolean function g. We derive the necessary and sufficient conditions on the function g for the existence of such representations for any Boolean function.
This is a preview of subscription content, log in via an institution to check access.
References
V. I. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, Computer-Aided Computer Design [in Russian], Naukova Dumka, Kiev (1975).
A. D. Zakrevskii, Logic Design of Cascaded Circuits [in Russian], Nauka, Moscow (1981).
B. G. Fedorkov and V. A. Telets, DAC and ADC Microcircuits: Operation, Parameters, Application [in Russian], Energoatomizdat, Moscow (1990).
D. A. Pospelov, Logical Methods of Circuit Analysis and Synthesis [in Russian], Energiya, Moscow (1974).
V. P. Suprun, “A method of polynomial expansion of Boolean functions,” Kibernetika, No. 5, 122–124 (1989).
Zh. Toshich, “Polynomial representations of Boolean functions and their minimization,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 3, 141–143 (1967).
V. L. Artyukhov, G. A. Kopeikin, and A. A. Shalyto, Adjustable Modules for Control Logic [in Russian], Energoizdat, Leningrad (1981).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 175–179, May–June, 1992.
Rights and permissions
About this article
Cite this article
Vinokurov, S.F., Peryazev, N.A. Representation of Boolean functions by polynomial forms. Cybern Syst Anal 28, 480–483 (1992). https://doi.org/10.1007/BF01125430
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01125430