Technology independent optimization when implementing sparse systems of disjunctive normal forms of Boolean functions in ASIC
Objectives. The problem of choosing the best methods and programs for circuit implementation as part of digital ASIC (Application-Specific Integrated Circuit) sparse systems of disjunctive normal forms (DNF) of completely defined Boolean functions is considered. For matrix forms of sparse DNF system...
Saved in:
| Main Authors: | P. N. Bibilo, S. N. Kardash |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2024-03-01
|
| Series: | Informatika |
| Subjects: | |
| Online Access: | https://inf.grid.by/jour/article/view/1276 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Experimental comparison of the effectiveness of programs for minimizing systems of Boolean functions in the class of disjunctive normal forms
by: P. N. Bibilo, et al.
Published: (2022-06-01) -
Algorithms for extracting subsystems from a multilevel representation of a system of Boolean functions for joint minimization
by: P. N. Bibilo, et al.
Published: (2024-12-01) -
Satisfiability in intuitionistic fuzzy logic with realistic tautology
by: Ali Muhammad Rushdi, et al.
Published: (2018-05-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)