Disjoint-support boolean decomposition combining functional and structural methods

Abstract

Abstract-This paper presents an algorithm for disjointsupport decomposition of Boolean functions which combines functional and structural approaches. First, a set of proper cut points is identified in the circuit by using dominator relations (structural method). Then, the circuit is partitioned along these cut points and a BDD-based decomposition is applied to the resulting smaller functions (functional method). Previous work on Boolean decomposition used only single methods and did not integrate a combined strategy. The experimental results show that the presented technique is more robust than a pure BDD-based approach and produces better-quality decompositions.

BDD‐based synthesis for mixed CMOS/PTL logic

“…The BDD synthesis is a sequence of decomposition with respect to a variable 22, 23, and thus the characteristics of a function related to this variable must be considered. Let f ( x 1 , x 2 , …, x i , …, x n ) be an Boolean function with the Shannon expression: …”