Due to the increasing miniaturization according to Moore's law, classical circuit design will
reach soon its limits. Reversible computation is an interesting alternative, since it provides a …

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 …

This work presents theoretical results and an efficient heuristic algorithm for minimizing
single-output exclusive-or sum-of-products expressions, based on an iterative product term …

We propose faster-computing methods for the minimization algorithm of AND–EXOR
expressions, or exclusive-or sum-of-products expressions (ESOPs), and obtain the exact …

Reversible logic circuit is a necessary construction for achieving ultra low power dissipation
as well as for prominent post-CMOS computing technologies such as Quantum computing …

A generalized simplify rules of conjuncterms in polynomial set-theoretical format is
considered. These rules are based on the proposed theorems for different initial transform …

Two parallel algorithms are proposed in this paper for solving the problem of finding exact
exclusive-or sum of products (ESOP) expressions for an arbitrary Boolean function. This …

In this work, a novel Multiple Valued Exclusive-Or Sum Of Products (MVESOP) minimization
formulation is analyzed and an algorithm is presented that detects minimum MVESOP …

The Exclusive-OR Sum-of-Product (ESOP) minimization problem has long been of interest to
the research community because of its importance in classical logic design (including low …

A novel approach is suggested in this paper for the minimization of Boolean expressions.
This is particularly useful in logic synthesis, since it leads to simpler logic circuit …