Towards a symbolic logic minimization algorithm

This paper presents the application of the recently introduced implicit sets of products manipulations based on binary decision diagrams to the generation of irredundant prime covers of Boolean functions and of multiple output Boolean functions. The results obtained with this procedure are compared with the ones obtained with ESPRESSO and with the procedure presented in [ll].

[1]  Eugenio Morreale,et al.  Recursive Operators for Prime Implicant and Irredundant Normal Form Determination , 1970, IEEE Transactions on Computers.

[2]  O. Coudert,et al.  A New Graph Based Prime Computation Technique , 1993 .

[3]  Saburo Muroga,et al.  Absolute Minimization of Completely Specified Switching Functions , 1991, IEEE Trans. Computers.

[4]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

[5]  Robert K. Brayton,et al.  Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[6]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[7]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[8]  C. Zheng,et al.  ; 0 ; , 1951 .

[9]  Olivier Coudert,et al.  Symbolic prime generation for multiple-valued functions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[10]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[11]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[12]  Olivier Coudert,et al.  A new method to compute prime and essential prime implicants of Boolean functions , 1992 .

[13]  Tsutomu Sasao.  An application of multiple-valued logic to a design of programmable logic arrays , 1978, MVL '78.

[14]  R. Bryant.  Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .

[15]  Olivier Coudert,et al.  Implicit and incremental computation of primes and essential primes of Boolean functions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.