#### Filter Results:

#### Publication Year

2005

2012

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

— This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary multi-output switching function that is not necessarily completely specified. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to… (More)

In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables is proposed. This kind of logical expressions can be mapped to a special cellular architecture, called Reversible Wave Cascade Architecture. This topology is useful, because it… (More)

SUMMARY In this paper two algorithms for the synthesis and minimization of a CA (cellular array architecture) are proposed. Starting from a completely specified single-output switching function, our methods produce rectangularly shaped arrays of cells, interconnected in chains, with an effort to minimize the number of the produced chains (cascades). This… (More)

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… (More)

In this work, a novel heuristic algorithm for the minimization of Exclusive-Or Sum Of Products (ESOP) expressions for multiple output incompletely specified functions is presented. An initial algorithm, DCMIN, uses functional decomposition and multiple-valued logic in order to produce almost minimal expressions for these functions. Based on DCMIN, an… (More)

- ‹
- 1
- ›