dc.contributor.author |
Voudouris, D |
en |
dc.contributor.author |
Stergiou, S |
en |
dc.contributor.author |
Papakonstantinou, G |
en |
dc.date.accessioned |
2014-03-01T02:43:25Z |
|
dc.date.available |
2014-03-01T02:43:25Z |
|
dc.date.issued |
2005 |
en |
dc.identifier.issn |
0916-8508 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/31394 |
|
dc.subject |
Complex term |
en |
dc.subject |
ESCT |
en |
dc.subject |
Exact minimization |
en |
dc.subject |
Heuristic minimization |
en |
dc.subject |
Maitra |
en |
dc.subject |
Reversible circuit |
en |
dc.subject |
Wave cascade |
en |
dc.subject.classification |
Computer Science, Hardware & Architecture |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.classification |
Engineering, Electrical & Electronic |
en |
dc.subject.other |
Algorithms |
en |
dc.subject.other |
Circuit theory |
en |
dc.subject.other |
Functions |
en |
dc.subject.other |
Heuristic methods |
en |
dc.subject.other |
Optimization |
en |
dc.subject.other |
Quantum theory |
en |
dc.subject.other |
Ternary systems |
en |
dc.subject.other |
Topology |
en |
dc.subject.other |
Complex term |
en |
dc.subject.other |
Exact minimization |
en |
dc.subject.other |
Heuristic minimization |
en |
dc.subject.other |
Maitra |
en |
dc.subject.other |
Reversible circuits |
en |
dc.subject.other |
Wave cascades |
en |
dc.subject.other |
Switching |
en |
dc.title |
Minimization of reversible wave cascades |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1093/ietfec/e88-a.4.1015 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1093/ietfec/e88-a.4.1015 |
en |
heal.language |
English |
en |
heal.publicationDate |
2005 |
en |
heal.abstract |
In this paper two algorithms for the synthesis and minimization of a CA (cellular army 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). Copyright © 2005 The Institute of Electronics, Information and Communication Engineers. |
en |
heal.publisher |
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG |
en |
heal.journalName |
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
en |
dc.identifier.doi |
10.1093/ietfec/e88-a.4.1015 |
en |
dc.identifier.isi |
ISI:000228412600029 |
en |
dc.identifier.volume |
E88-A |
en |
dc.identifier.issue |
4 |
en |
dc.identifier.spage |
1015 |
en |
dc.identifier.epage |
1023 |
en |