Suboptimal Decomposition of Boolean Functions

Abstract

Decomposition of Boolean functions is an effective technique to obtain the most com,pact circuits. The ternary matrix cover approach is a powerful method in two-block disjoint decomposition. Before constructing the desired superposition, this method needs to encode a table. To find a better solution, it is important to use a particular approach for encoding, because its result has a direct influence on the obtained functions. We present an efficient algorithm to encode this table. It uses the approach connected with the assembling Boolean hyper cube method. The benefits and impacts of the suggested technique are discussed.