Abstract
The results of the experimental comparison of minimization programs for various forms of representations of the systems of completely specified Boolean functions are described. The experiments show that the minimization programs of multilevel representations based on the Shannon expansion and decomposition are preferential when synthesizing combinational logic circuits from library elements compared to the minimization programs in a class of disjunctive normal forms.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bibilo, P.N. and Romanov, V.I., Logicheskoe proektirovanie diskretnykh ustroistv s ispol’zovaniem produktsionno-freimovoi modeli predstavleniya znanii (Logical Design of Discrete Devices with Product-Frame Model of Knowledge), Minsk: Belarus. navuka, 2011.
Zakrevskii, A.D., Logicheskii sintez kaskadnykh skhem (Logical Synthesis of Cascade Circuits), Moscow: Nauka, 1981.
Brayton, K.R., Hactel, G.D., McMullen, C.T., and Sangiovanni-Vincentelli, A.L., Logic Minimization Algorithm for VLSI Synthesis, Boston: Kluwer Academic, 1984.
Toropov, N.R., Minimization of systems of Boolean functions in DNF, in Logicheskoe proektirovanie (Logic Design), Minsk: Inst. Tekh. kibernetiki NAN Belarusi 1999, no. 4, pp. 4–19.
Zakrevskii, A.D., Pottosin, Yu.V., and Cheremisinova, L.D., Logicheskie osnovy proektirovaniya diskretnykh ustroistv (Logical Fundamentals for Discrete Devices Design), Moscow: Fizmatlit, 2007.
Bryant, R.E. and Meinel, C., Ordered binary decision diagrams, in Logic Synthesis and Verification, Hassoun, S., Sasao, T., and Brayton, R.K., Dordrecht: Kluwer Academic 2002, pp. 285–307.
Knuth, D.E., The Art of Computer Programming, vol. 4A: Combinatorial Algorithms, Upper Saddle River, New Jersey: Addison-Wesley, 2011, pt. 1.
Bibilo, P.N. and Leonchik, P.V., Decomposition of systems of Boolean functions determined by binary decision diagrams, J. Comput. Syst. Sci. Int. 2011, vol. 50, no. 4, pp. 609–624.
Pottosin, Yu.V. and Shestakov, E.A., Tablichnye metody dekompozitsii sistem polnost’yu opredelennykh bulevykh funktsii (Tabular Methods for Decomposition of Systems of Completely Specified Boolean Functions), Minsk: Belarus. navuka, 2006.
Sadnikov, D.V., Development of tabular method for decomposition of system of completely specified Boolean functions, Informatika 2005, no. 2, pp. 43–53.
Porwik, P. and Stankovic, R.S., Dedicated spectral method of Boolean function decomposition, Int. J. Appl. Math. Comput. Sci. 2006, vol. 16, no. 1, pp. 271–278.
Bibilo, P.N., Dekompozitsiya bulevykh funktsii na osnove resheniya logicheskikh uravnenii (Decomposition of Boolean Functions Based on Solving Logical Equations), Minsk: Belarus. navuka, 2009.
Gol’dberg, E.I., Decomposition of PLM, Preprint of Inst. of Tech. Cibernetics, Academy of Sciences BSSR, Minsk, 1991, no. 6.
Bibilo, P.N. and Leonchik, P.V., The algorithm of the construction of a binary decision diagram for the system of completely defined Boolean functions, Upravl. Sist. Mashiny 2009, no. 6, pp. 42–49.
Tagavi Afshord, S.Kh. and Pottosin, Yu.V., Study of decomposition properties of Boolean function systems, Informatika 2013, no. 4, pp. 94–103.
Bibilo, P.N., Sistemy proektirovaniya integral’nykh skhem na osnove yazyka VHDL. StateCAD, ModelSim, LeonardoSpectrum (Systems of Design of Integrated Circuits Based on VHDL, StateCAD, ModelSim, LeonardoSpectrum), Moscow: SOLON-Press, 2005.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © N.A. Avdeev, P.N. Bibilo, 2015, published in Mikroelektronika, 2015, Vol. 44, No. 5, pp. 383–399.
Rights and permissions
About this article
Cite this article
Avdeev, N.A., Bibilo, P.N. Logical optimization efficiency in the synthesis of combinational circuits. Russ Microelectron 44, 338–354 (2015). https://doi.org/10.1134/S1063739715050029
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1063739715050029