EMPLOYING COMPLEXITY ESTIMATES OF BINARY DECISION DIAGRAMS IN THE SYNTHESIS OF LOGICAL CIRCUITS
A formula is suggested to evaluate the area of a logical circuit that is built in a given library of logical elements according to the BDD (Binary Decision Diagram) representation of a system of Boolean functions. The experimental results of synthesis of combinational logical circuits from the minim...
Saved in:
| Main Authors: | N. A. Avdeev, P. N. Bibilo |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2016-09-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/23 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Application of decision diagrams of incompletely specified of k-valued logic functions in the synthesis of logical circuits
by: P. N. Bibilo
Published: (2023-06-01) -
Disjunctive and conjunctive decompositions of incompletely defined Boolean functions in a Binary Decision Diagram
by: P. N. Bibilo
Published: (2025-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) -
Synthesis of parallel adders from if-decision diagrams
by: A. A. Prihozhy
Published: (2020-08-01) -
Efficient pairing-free CP-ABE based on ordered binary decision diagram
by: Sheng DING, et al.
Published: (2019-12-01)