Application of decision diagrams of incompletely specified of k-valued logic functions in the synthesis of logical circuits
Objectives. The problem of circuit implementation of incompletely specified (partial) k-valued logic functions given by tabular representations is considered. The stage of technologically independent optimization is studied to obtain minimized representations of systems of completely specified Boole...
Saved in:
| Main Author: | P. N. Bibilo |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2023-06-01
|
| Series: | Informatika |
| Subjects: | |
| Online Access: | https://inf.grid.by/jour/article/view/1240 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Logical minimization for combinatorial structure in FPGA
by: P. N. Bibilo, et al.
Published: (2021-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) -
Disjunctive and conjunctive decompositions of incompletely defined Boolean functions in a Binary Decision Diagram
by: P. N. Bibilo
Published: (2025-03-01) -
Logical optimization of Boolean nets using Shannon expansion
by: P. N. Bibilo, et al.
Published: (2019-06-01) -
Logical optimization the multilevel representations of systems of Boolean functions based on partitioning into blocksand Shannon decomposition
by: P. N. Bibilo, et al.
Published: (2018-09-01)