Skip to Main Content
Recently introduced pseudoproducts and sum of pseudoproduct (SPP) forms have made it possible to represent Boolean functions with much shorter expressions than standard sum of products (SP) forms. A pseudo product is a product (AND) of exclusive OR (EXOR) factors, and an SPP form is a sum (OR) of pseudoproducts. The synthesis of SPP minimal forms requires greater effort than SP minimization. In this paper we present a new data structure for this problem, leading to an efficient minimization method for SPP forms implemented with an exact algorithm and an heuristic. Experimental results on a classical set of benchmarks show that the new algorithms are fast, and can be applied to "complex" functions with a reasonable running time.