Comparative Analysis of the Efficiency of the Transformation Algorithm and the Cycles Decomposition Algorithm for the Synthesis of Ternary Reversible Circuits

Página do item simplificado
dc.contributor.authorBarbieri, Caroline
dc.contributor.authorMoraga, Claudio
dc.contributor.authorLotufo, Anna Diva Plasencia [UNESP]
dc.contributor.authorMinussi, Carlos Roberto [UNESP]
dc.contributor.institutionInst Fed Sao Paulo
dc.contributor.institutionTech Univ Dortmund
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)
dc.date.accessioned2022-04-28T18:46:00Z
dc.date.available2022-04-28T18:46:00Z
dc.date.issued2022-01-01
dc.description.abstractThe design algorithm for binary reversible circuits based on the decomposition of permutations as cascade of disjoint cycles (CD algorithm) is extended to the ternary domain. Its performance is evaluated using as a benchmark all 362, 880 ternary reversible functions of two arguments, and is compared to that of the transformation based MMD algorithm. It is shown that in 96.71% of the cases the MMD algorithm leads to reversible circuits with a cost not higher than that obtained with the CD algorithm, and in 54.39% of the cases the MMD algorithm leads to reversible circuits with a cost lower than that obtained with the CD algorithm. Moreover the CD algorithm in 96% of the circuits reaches realizations with lower cost compared to the cost of decompositions into transpositions and in 69.5% of the circuits with respect to decompositions into 3-cycles. The results may be extended to the class of 2 x 2-based n x n ternary reversible functions.en
dc.description.affiliationInst Fed Sao Paulo, Campus Capivari, Sao Paulo, Brazil
dc.description.affiliationTech Univ Dortmund, Fac Comp Sci, Dortmund, Germany
dc.description.affiliationState Univ Julio de Mesquita Filho, Sao Paulo, Brazil
dc.description.affiliationUnespState Univ Julio de Mesquita Filho, Sao Paulo, Brazil
dc.format.extent509-532
dc.identifier.citationJournal Of Multiple-valued Logic And Soft Computing. Philadelphia: Old City Publishing Inc, v. 38, n. 5-6, p. 509-532, 2022.
dc.identifier.issn1542-3980
dc.identifier.urihttp://hdl.handle.net/11449/218995
dc.identifier.wosWOS:000773518100005
dc.language.isoeng
dc.publisherOld City Publishing Inc
dc.relation.ispartofJournal Of Multiple-valued Logic And Soft Computing
dc.sourceWeb of Science
dc.subjectReversible circuits synthesis
dc.subjectquantum computing
dc.subjectmultiple-valued logic
dc.titleComparative Analysis of the Efficiency of the Transformation Algorithm and the Cycles Decomposition Algorithm for the Synthesis of Ternary Reversible Circuitsen
dc.typeArtigo
dcterms.rightsHolderOld City Publishing Inc

Arquivos

Coleções

Artigos - Engenharia Elétrica - FEIS