Sciweavers

Share
CDES
2008

Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7

10 years 5 months ago
Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven complex terms, regardless of the number of input variables. This kind of logical expressions can be mapped to a special cellular architecture, called Reversible Wave Cascade Architecture. This topology is proved to be very useful, as it is reversible and therefore it may help in the design of quantum circuits. Moreover, the proposed algorithm is extended heuristically for functions with eight or more complex terms.
Dimitrios Voudouris, Marinos Sampson, George K. Pa
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where CDES
Authors Dimitrios Voudouris, Marinos Sampson, George K. Papakonstantinou
Comments (0)
books