Minimizing Binary Decision Diagrams for Systems of Incompletely Defined Boolean Functions Using Algebraic Cofactor Expansions.

Autor: Bibilo, P. N.
Zdroj: Journal of Computer & Systems Sciences International; Aug2022, Vol. 61 Issue 4, p539-566, 28p
Abstrakt: The main optimization criterion in the synthesis of combinational circuits from library logic elements is the number of literals in algebraic multilevel representations of systems of fully defined Boolean functions. After obtaining the binary decision diagrams of the initial systems of incompletely defined (partial) Boolean functions, it is proposed to perform additional logical optimization based on the search for algebraic representations of partial subfunctions (cofactors) of one level of a binary decision diagram in the form of a disjunction or conjunction of other subfunctions of the given level of a binary decision diagram. The proposed method makes it possible to reduce the number of literals by replacing the Shannon expansion (decomposition) formulas with simpler formulas in the transition to a multilevel representation of a system of completely defined functions, according to which a combinational logic circuit is synthesized. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: