Exact Synthesis of ESOP Forms
From MaRDI portal
Abstract: We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function. The approach can deal with incompletely-specified Boolean functions defined over many Boolean variables and is particularly fast if the Boolean function can be expressed with only a few product terms. We describe the formalization of the ESOP synthesis problem with a fixed number of terms as a decision problem and present search procedures for determining ESOP forms of minimum size. We further discuss how the search procedures can be relaxed to find ESOP forms of small sizes in reasonable time. We experimentally evaluate the performance of the SAT-based synthesis procedures on completely- and incompletely-specified Boolean functions.
Recommendations
- Compact DSOP and partial DSOP forms
- Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions
- Minimizing AND-EXOR expressions for two-variable multiple-valued input binary output functions
- scientific article; zbMATH DE number 3902554
- Minimizing ESCT forms for two-variable multiple-valued input binary output functions
Cites work
- A continuous approach to inductive inference
- Conservative logic
- scientific article; zbMATH DE number 910724 (Why is no real title available?)
- scientific article; zbMATH DE number 3231579 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Pseudo-Kronecker expressions for symmetric functions
- Theory and Applications of Satisfiability Testing
- Young subgroups for reversible computers.
This page was built for publication: Exact Synthesis of ESOP Forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181733)
