Abstract
Binary decision diagram (BDD) is used for technology-independent optimization, performed as the first stage in the synthesis of logic circuits in the design of application-specific integrated circuits (ASICs). BDD is an acyclic graph defining a Boolean function or a system of Boolean functions. Each vertex of this graph is associated with the complete or reduced Shannon expansion formula. Binary decision diagrams with mutually inverse subfunctions (cofactors) are considered. We have developed algorithms for finding algebraic representations of cofactors of the same BDD level in the form of a disjunction or conjunction of other inverse or non-inverse cofactors of the same BDD level. The algorithms allow reducing the number of literals by replacing the Shannon expansion formulas of a system of Boolean functions. It is proposed to use the developed algorithms for an additional logic optimization of the constructed BDD representations of systems of Boolean functions. The experimental results of application of the corresponding programs in synthesizing the logic circuits in the design library of custom VLSI CMOS circuits are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Brayton, R.K., Hachtel, G.D., and Sangiovanni-Vincentelli, A.L., Synthesis of multi-level combinational logic circuits, Tr. Inst. Inzh. Elektron. Radiotehn., 1990, vol. 78, no. 2, pp. 38–83.
Meinel, C. and Theobald, T., Algorithms and Data Structures in VLSI Design: OBDD – Foundations and Applications, Berlin, Heidelberg: Springer-Verlag, 1998.
Knuth, D.E., Combinatorial algorithms, in The Art of Computer Programming, Pearson Education, Inc., 2011, vol. 4A.
Yang, S. and Ciesielski, M., BDS: a BDD-based logic optimization system, IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., 2002, vol. 21, no. 7, pp. 866–876.
Ebendt, R., Fey, G., and Drechsler, R., Advanced BDD Optimization, Springer, 2005.
Bibilo, P.N., Primenenie diagramm dvoichnogo vybora pri sinteze logicheskikh skhem (Binary Decision Diagrams for Synthesizing Logic Circuits), Minsk: Belaruskaya navuka, 2014.
Kubica, M. and Kania, D., SMTBDD: new form of BDD for logic synthesis, Int. J. Electron. Telecommun., 2016, vol. 62, no. 1, pp. 33–41.
Bibilo, P.N. and Romanov, V.I., Minimization of binary decision diagrams for systems of completely defined Boolean functions by using Shannon expansions and algebraic representations of cofactors, Informatika, 2021, vol. 18, no. 2, pp. 7–32.
Bibilo, P.N. and Lankevich, Yu.Yu., Zhegalkin polynomials for minimizing multilevel representations of Boolean functions systems based on the Shannon expansion, Programm. Inzheneriya, 2017, vol. 8, no. 8, pp. 369–384.
Search for elementary cycles in a graph. https://vscode.ru/prog-lessons/poisk-elementarnyih-tsiklov-v-grafe.html. Accessed 05.082021.
Johnson, D.B., Finding all the elementary circuits of a directed graph, SIAM J. Comput., 1975, vol. 4, no. 1, pp. 77–84.
Toropov, N.R., Multi-level combinational network transformation into a two-level one, in Logicheskoe proektirovanie (Logic Design), Minsk: United Institute of Informatics Problems of the National Academy of Sciences of Belarus, 2000, issue 5, pp. 4–14.
Shlee, M., Qt 5.10. Professional Programming in C++, St. Petersburg: BKhV-Peterburg, 2018.
Romanov, V.I., Software tools for solving logic-combinatorial problems, Informatika, 2005, no. 4, pp. 114–123.
Bibilo, P.N. and Romanov, V.I., Logicheskoe proektirovanie diskretnykh ustroistv s ispol’zovaniem produktsionno-freimovoi modeli predstavleniya znanii (Logical Design of Discrete Devices by Using a Production-Frame Knowledge Representation Model), Minsk: Belaruskaya navuka, 2011.
Bibilo, P.N. and Romanov, V.I., The system of logical optimization of functional and structural descriptions for digital devices based on production-frame knowledge representation model, in Problemy razrabotki perspektivnyh mikro- i nanoelektronnyh sistem. – 2020. sb. trudov (Promising Micro- and Nano-Electronic Systems: Design Problems. Collection of Scientific Papers 2020), Stempkovskii, A.L., Ed., Moscow: Institute for Design Problems in Microelectronics RAS, 2020, no. 4.
The Tests in the Monograph «Logic Minimization Algorithms for VLSI Synthesis». http://www1.cs.columbia.edu/~cs6861/sis/espresso-examples/ex. Accessed 20.11.2020.
Balaka, E.S., Tel’pukhov, D.V., Osinin, I.P., and Gorodetskii, D.A., Comparative study and analysis of hardware implementation methods for adders in absolute values, 7Universum: Tekh. Nauki: Elektron. Nauch. Zh., 2016, no. 1 (23). http://7universum.com/ru/tech/archive/item/2887.
Bibilo, P.N., Sistemy proektirovaniya integral’nykh skhem na osnove yazyka VHDL. StateCAD, ModelSim, LeonardoSpectrum (Integrated Circuit Design Systems Based on the VHDL Language: StateCAD, ModelSim, LeonardoSpectrum), Moscow: SOLON-Press, 2005.
Avdeev, N.A. and Bibilo, P.N., Automated Design for Digital Operational Units with Low Power Consumption, Programm. Inzheneriya, 2021, no. 2, pp. 63–73.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Translated by E. Oborin
Rights and permissions
About this article
Cite this article
Bibilo, P.N., Romanov, V.I. Experimental Study of Algorithms for Minimization of Binary Decision Diagrams Using Algebraic Representations of Cofactors. Program Comput Soft 49, 268–285 (2023). https://doi.org/10.1134/S0361768823040035
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768823040035