Name
Abstract | ||
|---|---|---|
Abstract In this paper an algorithm is proposed for the synthesis and exact min- imization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven complex terms, regardless of the num- ber of input variables. This kind of logical expressions can be mapped to a special cellular architecture, called Reversible Wave Cascade Archi- tecture. 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. |
Year | Venue | Keywords |
|---|---|---|
2008 | CDES | boolean function |
Field | DocType | Citations |
Maximum satisfiability problem,Boolean function,Discrete mathematics,Combinatorics,Boolean circuit,Parity function,Product term,Boolean expression,Circuit minimization for Boolean functions,Mathematics,Two-element Boolean algebra | Conference | 1 |
PageRank | References | Authors |
0.40 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dimitrios Voudouris | 1 | 21 | 3.66 |
| Marinos Sampson | 2 | 11 | 2.22 |
| George K. Papakonstantinou | 3 | 159 | 61.88 |