An Algorithm for Detecting XOR-Type Logic

In this paper we formulate a sufficient condition for Boolean functions to have a decomposition of type , with the total number of product-terms in , and smaller than the number of product-terms in . This condition is used to develop an algorithm for deciding whether a given function is likely to benefit from XOR minimization.

[1]  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.

[2]  Carl Sechen,et al.  Quasi-algebraic decompositions of switching functions , 1995, Proceedings Sixteenth Conference on Advanced Research in VLSI.

[3]  Santanu Chattopadhyay,et al.  KGPMIN: an efficient multilevel multioutput AND-OR-XOR minimizer , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[5]  Tsutomu Sasao.  A Design Method for AND-OR-EXOR Three-Level Networks , 1995 .

[6]  Stephen Y. H. Su,et al.  Computer Minimization of Multivalued Switching Functions , 1972, IEEE Transactions on Computers.

[7]  Sze-Tsen Hu.  ON THE DECOMPOSITION OF SWITCHING FUNCTIONS , 1961 .

[8]  H. A. Curtis,et al.  A new approach to The design of switching circuits , 1962 .