Skip to Main Content
A method for computing the disjoint-sum-of-products (DSOP) form of Boolean functions is described. The algorithm exploits the property of the most binate variable in a set of cubes to compute a DSOP form. The technique uses a minimized sum-of-products (SOP) cube list as input. Experimental results comparing the size of the DSOP cube list produced by this algorithm and those produced by other methods demonstrate the efficiency of this technique and show that superior results occur in many cases for a set of benchmark functions.