Abstract
A problem of synthesizing logic circuits of units is considered. Here, an arbitrary self-dual symmetric Boolean function depending on three, five, or seven variables is realized in a single output. The constructive complexity of the synthesized logic circuits is determined by the number of inputs of logic elements, while the operating speed is influenced by the depth of the circuit. The logic circuits exceed the existing analogues in terms of complexity and operating speed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Shalyto, A.A., Methods for constructing multifunctional logic modules, J. Compt. Syst. Sci. Int., 2004, vol. 43, pp. 923–935.
Kartsev, M.A., Arifmetika tsifrovykh mashin (Arithmetics of Digital Machines), Moscow: Nauka, 1969.
Fridman, A. and Menon, P., Teoriya i proektirovanie pereklyuchatel’nykh skhem (Theory and Design of Switching Schemes), Comp. Sci., 1975.
Artyukhov, V.L., Kopeikin, G.N., and Shalyto, A.A., Nastraivaemye moduli dlya upravlyayushchikh logicheskikh ustroistv (Adjustable Modules for Directing Logic Equipment), Leningrad: Energoizdat, 1981.
Suprun, V.P. and Sedun, A.M., Method of two-level scheme realization of symmetrical Boolean functions, Materialy vtoroi mezhdunarodnoi konferentsii “Avtomatizatsiya proektirovaniya diskretnykh system” (CAD DD’97) (Proc. 2nd Int. Conf. “Automation of Discrete System Design” (CAD DD’97)), Vol. 2, Minsk, 1997, pp. 6–11.
Sedun, A.M. and Suprun, V.P., Realization of symmetrical Boolean functions by logic devices with complex adjustment, Trudy pyatoi mezhdunarodnoi konferentsii “Novye informatsionnye tekhnologii” (Proc. 5nd Int. Conf. “New Information Technologies” (NITe’2002)), Minsk, 2002, pp. 116–120.
Suprun, V.P. and Sedun, A.M., Scheme realization of fundamental symmetrical Boolean functions by logic devices with complex adjustment, Materialy chetvertoi mezhdunarodnoi konferentsii “Avtomatizatsiya proektirovaniya diskretnykh system” (CAD DD’01) (Proc. 4nd Int. Conf. “Automation of Discrete System Design “ (CAD DD’01)), Vol. 2, Minsk, 2001, pp. 86–91.
Suprun, V.P., Synthesis of logical devices for calculation of polinomial-homogeneous symmetrical Boolean functions, Materialy shestoi mezhdunarodnoi konferentsii “Avtomatizatsiya proektirovaniya diskretnykh sistem” (CAD DD’07) (Proc. 6nd Int. Conf. “Automation of Discrete System Design “ (CAD DD’07)), Vol. 2, Minsk, 2007, pp. 146–153.
Shalyto, A.A., Modules which are universal in the class of self-dual functions and in close classes, J. Compt. Syst. Sci. Int., 2001, vol. 40, pp. 782–792.
Solov’ev, V.V. and Klimovich, A., Logicheskoe proektirovanie tsifrovykh sistem na osnove programmmiruemykh logicheskikh integral’nykh skhem (Logic Design of Digital Systems on the Basis of programmable logical integral schemes), Moscow: Goryachaya Liniya — Telekom, 2008.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.P. Suprun, F.S. Korobko, 2014, published in Avtomatika i Vychislitel’naya Tekhnika, 2014, No. 1, pp. 26–35.
About this article
Cite this article
Suprun, V.P., Korobko, F.S. Synthesis of logic units for calculating self-dual symmetric Boolean functions. Aut. Control Comp. Sci. 48, 17–24 (2014). https://doi.org/10.3103/S0146411614010088
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411614010088