277 search results - page 27 / 56 » A transformation based algorithm for reversible logic synthe... |
128
click to vote
DATE
1999
IEEE
15 years 9 months ago
1999
IEEE
Different logic synthesis tasks have been formulated as input encoding problems but restricted to use a minimum number of binary variables. This paper presents an original column ...
143
click to vote
CIIA
2009
15 years 6 months ago
2009
In this paper, we present a new synthesis feature namely, "Xor matching", and the foldback product term synthesis for Complex Programmable Logic Devices (CPLD) architectu...
132
click to vote
ISCI
2007
15 years 5 months ago
2007
We define the Lukasiewicz transform as a residuated map and a homomorphism between semimodules over the semiring reducts of an MV-algebra. Then we describe the “Lukasiewicz Tra...
130
click to vote
JANCL
2008
15 years 5 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
148
Voted
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...