MINIMIZING THE MULTILEVEL REPRESENTATIONS OF SYSTEMS OF BOOLEAN FUNCTIONS BASED ON SHANNON DECOMPOSITION
A locally optimal algorithm is proposed to form a permutation of variables, which are used to obtain successive Shannon decompositions of a system of disjunctive normal forms of completely specified Boolean functions. The goal of it is a multilevel representation of functions which is called a reduc...
Main Authors: | P. N. Bibilo, Y. Y. Lankevich |
---|---|
Format: | Article |
Language: | Russian |
Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2017-06-01
|
Series: | Informatika |
Online Access: | https://inf.grid.by/jour/article/view/211 |
Similar Items
-
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) -
Logical optimization of Boolean nets using Shannon expansion
by: P. N. Bibilo, et al.
Published: (2019-06-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) -
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) -
The search for subsystems of related functions from multilevel representation of systems of Boolean functions1
by: P. N. Bibilo, et al.
Published: (2020-03-01)