Minimization of Reversible Wave Cascades

Dimitrios VOUDOURIS; Stergios STERGIOU; George PAPAKONSTANTINOU

doi:10.1093/ietfec/e88-a.4.1015

Minimization of Reversible Wave Cascades

Dimitrios VOUDOURIS, Stergios STERGIOU, George PAPAKONSTANTINOU

Full Text Views

0

Cite this

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 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).

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.4 pp.1015-1023

Publication Date: 2005/04/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.4.1015

Type of Manuscript: PAPER

Category: VLSI Design Technology and CAD

Cite this

Copy

Dimitrios VOUDOURIS, Stergios STERGIOU, George PAPAKONSTANTINOU, "Minimization of Reversible Wave Cascades" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 4, pp. 1015-1023, April 2005, doi: 10.1093/ietfec/e88-a.4.1015.
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).
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.4.1015/_p

Copy

@ARTICLE{e88-a_4_1015,
author={Dimitrios VOUDOURIS, Stergios STERGIOU, George PAPAKONSTANTINOU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Minimization of Reversible Wave Cascades},
year={2005},
volume={E88-A},
number={4},
pages={1015-1023},
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).},
keywords={},
doi={10.1093/ietfec/e88-a.4.1015},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Minimization of Reversible Wave Cascades
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1015
EP - 1023
AU - Dimitrios VOUDOURIS
AU - Stergios STERGIOU
AU - George PAPAKONSTANTINOU
PY - 2005
DO - 10.1093/ietfec/e88-a.4.1015
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2005
AB - 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).
ER -