Skip to main content
SpringerLink
Log in

Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram

  • Topical Issue
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We propose a decomposition method for systems of incompletely specified Boolean functions represented as binary decision diagrams. Minimizing the number of intermediate functions in such a decomposition is intended to improve the performance of Boolean circuits made of library elements. A characteristic feature of our method is the fact that after decomposition (cutting) of the original binary decision diagram one of two decomposition units is represented as a system of DNFs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Tanaev, V.S. and Povarich, M.P., Sintez graf-skhem algoritmov vybora reshenii (Synthesis of Flowgraphs for Decision Making Algorithms), Minsk: Nauka i Tekhnika, 1974.

    Google Scholar 

  2. Blokh, A.Sh., Graf-skhemy i ikh primenenie (Flowgraphs and Their Applications), Minsk: Vysheishaya Shkola, 1975.

    Google Scholar 

  3. Kuznetsov, O.P., Program Realization of Logical Functions and Automata. I, II, Autom. Remote Control, 1977, vol. 38, no. 7, part 2, pp. 1077–1088; no. 9, part 2, pp. 1385–1396.

    MATH  Google Scholar 

  4. Akers, S.B., Binary Decision Diagrams, IEEE Trans. Comput., 1978, vol. 27, no. 6, pp. 509–516.

    Article  MATH  Google Scholar 

  5. Bryant, R.E., Graph-Based Algorithms for Boolean Functions Manipulation, IEEE Trans. Comput., 1986, vol. 35, no. 8, pp. 677–691.

    Article  MATH  Google Scholar 

  6. Bryant, R.E. and Meinel, C., Ordered Binary Decision Diagrams, in Logic Synthesis and Verification, Hassoun, S., Sasao, T., and Brayton, R.K., Eds., Boston: Kluwer, 2002.

    Google Scholar 

  7. Meinel, C. and Theobald, T., Algorithms and Data Structures in VLSI Design: OBDD-Foundations and Applications, Berlin: Springer-Verlag, 1998.

    Book  Google Scholar 

  8. Karpov, Yu.G., MODEL CHECKING. Verifikatsiya parallel’nykh i raspredelennykh programmnykh sistem (Model Checking. Verification of Parallel and Distributed Software Systems), St. Petersburg: BKhVPeterburg, 2010.

    Google Scholar 

  9. Bibilo, P.N., Dekompozitsiya bulevykh funktsii na osnove resheniya logicheskikh uravnenii (Decomposition of Boolean Functions Based on Solving Logical Equations), Minsk: Belarus. Navuka, 2009.

    Google Scholar 

  10. Zakrevskii, A.D., Logicheskii sintez kaskadnykh skhem (Logical Synthesis of Cascade Circuits), Moscow: Nauka, 1981.

    Google Scholar 

  11. Sasao, T., FPGA Design by Generalized Functional Decomposition, in Representation of Discrete Functions, Sasao, T. and Fujita, M., Eds., Boston: Kluwer, 1996, pp. 233–258.

    Chapter  Google Scholar 

  12. Scholl, C., Functional Decomposition with Applications to FPGA Synthesis, Boston: Kluwer, 2001.

    Book  Google Scholar 

  13. Bibilo, P.N. and Romanov, V.I., Logicheskoe proektirovanie diskretnykh ustroistv s ispol’zovaniem produktsionnofreimovoi modeli predstavleniya znanii (Logical Design of Discrete Devices with Product-Frame Model of Knowledge Representation), Minsk: Belarus. Navuka, 2011.

    Google Scholar 

  14. Cortadella, J., Timing-Driven Logic Bi-Decomposition, IEEE Trans. Comput.-Aided Design Integrat. Circuits Syst., 2003, vol. 22, no. 6, pp. 675–685.

    Article  Google Scholar 

  15. Yang, S. and Ciesielski, M., BDS: A BDD-Based Logic Optimization System, IEEE Trans. Comput.-Aided Design Integrat. Circuits Syst., 2002, vol. 21, no. 7, pp. 866–876.

    Article  Google Scholar 

  16. Bibilo, P.N. and Leonchik, P.V., Decomposition of Systems of Boolean Functions Defined by Binary Decision Diagrams, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2011, no. 4, pp. 86–101.

    Google Scholar 

  17. Shneider, A.A., Analysis and Classification of Heuristic Graph Vertex Coloring Algorithms, Kibernetika, 1984, no. 4, pp. 15–22.

    Google Scholar 

  18. Bibilo, P.N. and Enin, S.V., Sintez kombinatsionnykh skhem metodami funktsional’noi dekompozitsii (Synthesis of Combinatorial Circuits with Functional Decomposition Methods), Minsk: Nauka i Tekhnika, 1987.

    Google Scholar 

  19. Knuth, D.E., The Art of Computer Programming, vol. 4A: Combinatorial Algorithms, Part 1, Reading: Addison-Wesley, 2011. Translated under the title Iskusstvo programmirovaniya, tom 4, A. Kombinatornye algoritmy, ch. 1, Moscow: Vil’yams, 2013.

    Google Scholar 

  20. Stojkovich, S., Stancović, M., and Stancović, R., Determining Assignment of Incompletely Specified Boolean Functions for Compact Representations by Binary Decision Diagrams, 10 Int. Workshop Boolean Probl., September 19–21, 2012, Freiberg (Sachsen), pp. 233–238.

  21. Gavrilov, M.A., Devyatkov, V.V., and Pupyrev, E.I., Logicheskoe proektirovanie diskretnykh avtomatov (Logical Design of Discrete Automata), Moscow: Nauka, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus

    P. N. Bibilo

Authors
  1. P. N. Bibilo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. N. Bibilo.

Additional information

Original Russian Text © P.N. Bibilo, 2014, published in Avtomatika i Telemekhanika, 2014, No. 7, pp. 17–42.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bibilo, P.N. Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram. Autom Remote Control 75, 1173–1194 (2014). https://doi.org/10.1134/S0005117914070017

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117914070017

Keywords

Search

Navigation