Disjunctive and conjunctive decompositions of incompletely defined Boolean functions in a Binary Decision Diagram
Objectives. The problems of minimizing the number of cofactors (subfunctions) of the Shannon expansions located at the same level of the BDD, representing a system of incompletely defined (partial) Boolean functions, are considered. To reduce the number of functions, it is proposed to find a subset...
Saved in:
| Main Author: | P. N. Bibilo |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2025-03-01
|
| Series: | Informatika |
| Subjects: | |
| Online Access: | https://inf.grid.by/jour/article/view/1321 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A method for bi-decomposition of partial Boolean functions
by: Yu. V. Pottosin
Published: (2019-12-01) -
Technology independent optimization when implementing sparse systems of disjunctive normal forms of Boolean functions in ASIC
by: P. N. Bibilo, et al.
Published: (2024-03-01) -
Minimization of binary decision diagrams for systems of completely defined Boolean functions using Shannon expansions and algebraic representations of cofactors
by: P. N. Bibilo, et al.
Published: (2021-07-01) -
A heuristic method for bi-decomposition of partial Boolean functions
by: Yu. V. Pottosin
Published: (2020-09-01) -
Logical optimization of Boolean nets using Shannon expansion
by: P. N. Bibilo, et al.
Published: (2019-06-01)