Bottom-up disjoint-support decomposition based on cofactor and boolean difference analysis

This paper presents a new approach for Boolean decomposition based on the Boolean difference and cofactor analysis. Two simple tests provide sufficient and necessary conditions to identify AND and exclusive-OR (XOR) decompositions. The proposed method can decompose an n-input function in O(n . log n) cofactor and O(n) equivalence test operations. Recently, 2-to-1 multiplexers (MUX) have also been used to perform such decomposition. However, MUX with more inputs has been neglected. We provide sufficient and necessary conditions to obtain MUX decompositions of functions with an arbitrary number of inputs.

[1]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[2]  Jr. Sheldon B. Akers,et al.  On a Theory of Boolean Functions , 1959 .

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

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

[5]  Richard M. Karp,et al.  Minimization Over Boolean Graphs , 1962, IBM J. Res. Dev..

[6]  Sharad C. Seth,et al.  On Combinational Networks with Restricted Fan-Out , 1978, IEEE Transactions on Computers.

[7]  Jean-Pierre Deschamps,et al.  Discrete and switching functions , 1978 .

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

[9]  V. Bertacco,et al.  The disjunctive decomposition of logic functions , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[10]  Valeria Bertacco,et al.  The disjunctive decomposition of logic functions , 1997, ICCAD 1997.

[11]  Giovanni De Micheli,et al.  Finding all simple disjunctive decompositions using irredundant sum-of-products forms , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[12]  Alan Mishchenko.  An Approach to Disjoint-Support Decomposition of Logic Functions , 2001 .

[13]  Yusuke Matsunaga.  An Efficient Algorithm Finding Simple Disjoint Decompositions Using BDDs , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[14]  V. Bertacco,et al.  STACCATO: disjoint support decompositions from BDDs through symbolic kernels , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[15]  A. Brayton.  Faster Logic Manipulation for Large Designs , 2012 .

[16]  Zheng Huang,et al.  Fast Boolean matching based on NPN classification , 2013, 2013 International Conference on Field-Programmable Technology (FPT).

[17]  A. Mishchenko.  Enumeration of Irredundant Circuit Structures , 2014 .

[18]  Sabrina Hirsch,et al.  Logic Minimization Algorithms For Vlsi Synthesis , 2016 .