A fast symbolic transformation based algorithm for reversible logic synthesis

DOI10.1007/978-3-319-40578-0_22MaRDI QIDQ3186608zbMATH OpenOpenAlexFDO

Authors Mathias Soeken, D. Michael Miller, G. W. Dueck

Publication date 10 August 2016

Published in Reversible Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-40578-0_22

zbMATH Keywords

binary decision diagramsBoolean satisfiabilityreversible circuit synthesissymbolic methods

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Recommendations

• A reversible logic synthesis algorithm based on the transformation of the truth table
• Ancilla-free synthesis of large reversible functions using binary decision diagrams
• Synthesis of reversible logic quantum circuits
• Synthesis of reversible circuits with minimal costs
• Synthesis and optimization of reversible circuits -- a survey

Cites work

• A structure-preserving clause form translation
• Ancilla-free synthesis of large reversible functions using binary decision diagrams
• Blocked clause elimination
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Quantum addition circuits and unbounded fan-out
• The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Young subgroups for reversible computers.

Cited in

(5)

• A reversible logic synthesis algorithm based on the transformation of the truth table
• Six Synthesis Methods for Reversible Logic
• Ancilla-free synthesis of large reversible functions using binary decision diagrams
• OR-Toffoli and OR-Peres Reversible Gates
• An efficient method to synthesize reversible logic by using positive Davio decision diagrams

Describes a project that uses

Uses Software

• RevKit

This page was built for publication: A fast symbolic transformation based algorithm for reversible logic synthesis

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