A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis

DOI10.1007/978-3-319-40578-0_22zbMath1480.94056OpenAlexW2487095096MaRDI QIDQ3186608

D. Michael Miller, Mathias Soeken, Gerhard 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

Boolean satisfiabilitybinary decision diagramssymbolic methodsreversible circuit synthesis

Mathematics Subject Classification ID

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

Related Items (1)

OR-Toffoli and OR-Peres Reversible Gates

Uses Software

• RevKit

Cites Work

• Unnamed Item
• Unnamed Item
• Ancilla-free synthesis of large reversible functions using binary decision diagrams
• Young subgroups for reversible computers.
• A structure-preserving clause form translation
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Blocked Clause Elimination
• Graph-Based Algorithms for Boolean Function Manipulation
• The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions

This page was built for publication: A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis