A new reversible circuit synthesis algorithm based on cycle representations of permutations

DOI10.1016/J.ENDM.2015.07.032zbMATH Open1348.68056OpenAlexW2221268839MaRDI QIDQ324775FDOQ324775

Authors: A. C. Ribeiro, L. A. B. Kowada, F. L. Marquezino, C. M. H. Figueiredo 

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.032

Recommendations

• A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations
• Cycles-based and transformation-based synthesis of ternary reversible circuits. Aspects of complexity
• Synthesis and optimization of reversible circuits -- a survey
• A coding theoretic approach towards symmetrization in reversible circuit synthesis

zbMATH Keywords

design of algorithmscircuit synthesisreversible computing

Mathematics Subject Classification ID

Cites Work

• Logical Reversibility of Computation
• Exploiting negative control lines in the optimization of reversible circuits
• Synthesis and optimization of reversible circuits -- a survey
• Templates for positive and negative control Toffoli networks

Cited In (7)

• Ricercar: a language for describing and rewriting reversible circuits with ancillae and its permutation semantics
• Application of Permutation Group Theory in Reversible Logic Synthesis
• Translation Techniques for Reversible Circuit Synthesis with Positive and Negative Controls
• Title not available (Why is that?)
• Graph transformation meets reversible circuits: generation, evaluation, and synthesis
• A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations
• Fast synthesis of invertible circuits based on permutation group theory

This page was built for publication: A new reversible circuit synthesis algorithm based on cycle representations of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324775)