Disjunctive decomposition of switching functions using symmetry information

A new approach to a simple disjunctive decomposition of a Boolean function is presented. It is based on using symmetric relations among a function's variables to recognize intrinsic characteristics of the function. The conditions for the existence of a simple disjunctive decomposition are formulated and a hierarchical simple disjunctive decomposition is generated in a bottom-up manner without exhaustive search. Results on benchmark functions are very encouraging.

[1]  Massoud Pedram,et al.  OBDD-based function decomposition: algorithms and implementation , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  S. L. Hurst,et al.  A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods , 1978, IEEE Transactions on Computers.

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

[4]  Alberto Sangiovanni-Vincentelli,et al.  Boolean decomposition in multilevel logic optimization , 1989 .

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

[6]  Giovanni De Micheli,et al.  Finding all simple disjunctive decompositions using irredundant sum-of-products forms , 1998, ICCAD '98.

[7]  Maciej J. Ciesielski,et al.  BDD decomposition for efficient logic synthesis , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[8]  Tsutomu Sasao,et al.  DECOMPOS : An integrated system for functional decomposition , 1998 .

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