Name
Abstract | ||
|---|---|---|
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 kind of cellular topology is known throughout the bibliography as Maitra cellular arrays. The significance of those algorithms is underlined by the fact that this particular type of cellular architecture can be mapped to reversible circuits and gates (generalized Toffoli gates), which are the type of logic used in quantum circuits. The proposed methodologies include use of ETDDs (EXOR ternary decision diagrams), and switching function decompositions (including new types of boolean expansions). |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1093/ietfec/e88-a.4.1015 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
ESCT, Maitra, complex term, wave cascade, reversible circuit, exact minimization, heuristic minimization | Cellular architecture,Quantum,Algorithm,Theoretical computer science,Ternary operation,Minification,Electronic circuit,ExOR,AND gate,Mathematics,Toffoli gate | Journal |
Volume | Issue | ISSN |
E88A | 4 | 0916-8508 |
Citations | PageRank | References |
5 | 0.51 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dimitrios Voudouris | 1 | 21 | 3.66 |
| Stergios Stergiou | 2 | 339 | 15.84 |
| George K. Papakonstantinou | 3 | 159 | 61.88 |