No label defined (Q4544358)

EXOR Ternary Decision Diagrams (EXOR-TDDs) are introduced for minimizing Boolean expressions. An \(n\)-variable switching (Boolean) function \(f(x_1,\dots ,x_n)\) is a simple disjoint decomposition with respect to the first \(r\) variables iff \(f(x_1,\dots ,x_n)=g(h(x_1,\dots ,x_r),x_{r+1},\dots ,x_n)\), where \(g\) and \(f\) are switching functions of \(r\) and \((n-r+1)\) variables, respectively. It is shown that the determination of whether or not an \(n\)-variable switching function is a simple disjoint decomposition with respect to \(r\) variables is equivalent to the construction of EXOR-TDDs for a matrix-valued function of \((n-r)\) variables.