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

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorInst Fed Sao Paulo-
Autor(es): dc.contributorTech Univ Dortmund-
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.creatorBarbieri, Caroline-
Autor(es): dc.creatorMoraga, Claudio-
Autor(es): dc.creatorLotufo, Anna Diva Plasencia [UNESP]-
Autor(es): dc.creatorMinussi, Carlos Roberto [UNESP]-
Data de aceite: dc.date.accessioned2022-08-04T22:00:28Z-
Data de disponibilização: dc.date.available2022-08-04T22:00:28Z-
Data de envio: dc.date.issued2022-04-28-
Data de envio: dc.date.issued2022-04-28-
Data de envio: dc.date.issued2021-12-31-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/218995-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/218995-
Descrição: dc.descriptionThe 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.-
Descrição: dc.descriptionInst Fed Sao Paulo, Campus Capivari, Sao Paulo, Brazil-
Descrição: dc.descriptionTech Univ Dortmund, Fac Comp Sci, Dortmund, Germany-
Descrição: dc.descriptionState Univ Julio de Mesquita Filho, Sao Paulo, Brazil-
Descrição: dc.descriptionState Univ Julio de Mesquita Filho, Sao Paulo, Brazil-
Formato: dc.format509-532-
Idioma: dc.languageen-
Publicador: dc.publisherOld City Publishing Inc-
Relação: dc.relationJournal Of Multiple-valued Logic And Soft Computing-
???dc.source???: dc.sourceWeb of Science-
Palavras-chave: dc.subjectReversible circuits synthesis-
Palavras-chave: dc.subjectquantum computing-
Palavras-chave: dc.subjectmultiple-valued logic-
Título: dc.titleComparative Analysis of the Efficiency of the Transformation Algorithm and the Cycles Decomposition Algorithm for the Synthesis of Ternary Reversible Circuits-
Tipo de arquivo: dc.typelivro digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.