Ancilla-free synthesis of large reversible functions using binary decision diagrams

DOI10.1016/j.jsc.2015.03.002zbMath1336.68310arXiv1408.3955OpenAlexW2069447786WikidataQ59242004 ScholiaQ59242004MaRDI QIDQ491242

Gerhard W. Dueck, Rolf Drechsler, Mathias Soeken, Laura Tague

Publication date: 24 August 2015

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.3955

zbMATH Keywords

synthesisbinary decision diagramsreversible functions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items

A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis ⋮ Checking Reversibility of Boolean Functions ⋮ Translation Techniques for Reversible Circuit Synthesis with Positive and Negative Controls ⋮ Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition

Uses Software

• RevKit
• ABC
• QMDD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Young subgroups for reversible computers.
• Efficient manipulation of decision diagrams
• Upper bounds for reversible circuits based on Young subgroups
• Synthesis and optimization of reversible circuits—a survey
• Reversible Computing
• Irreversibility and Heat Generation in the Computing Process
• Graph-Based Algorithms for Boolean Function Manipulation

This page was built for publication: Ancilla-free synthesis of large reversible functions using binary decision diagrams