Logic minimization using exclusive OR gates

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.

[1]  Valentina Ciriani,et al.  The characterization of the sub-pseudocubes of a pseudocube , 2000 .

[2]  Elena Dubrova,et al.  AOXMIN-MV: A Heuristic Algorithm for AND-OR-XOR Minimization , 1999 .

[3]  Fabrizio Luccio,et al.  On a New Boolean Function with Applications , 1999, IEEE Trans. Computers.

[4]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[5]  Tsutomu Sasao,et al.  A heuristic algorithm to design AND-OR-EXOR three-level networks , 1998, Proceedings of 1998 Asia and South Pacific Design Automation Conference.

[6]  Tiziano Villa,et al.  Synthesis of Finite State Machines: Logic Optimization , 1997 .

[7]  Robert K. Brayton,et al.  ESPRESSO-SIGNATURE: A New Exact Minimizer for Logic Functions , 1993, 30th ACM/IEEE Design Automation Conference.

[8]  Olivier Coudert,et al.  Doing two-level logic minimization 100 times faster , 1995, SODA '95.

[9]  Robert K. Brayton,et al.  ESPRESSO-SIGNATURE: a new exact minimizer for logic functions , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[10]  Robert K. Brayton,et al.  Three-level decomposition with application to PLDs , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.