Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition

DOI10.1007/978-3-319-20860-2_14zbMath1464.81016OpenAlexW2283945470WikidataQ59242245 ScholiaQ59242245MaRDI QIDQ2822513

Mathias Soeken, Rolf Drechsler, Nabila Abdessaied

Publication date: 30 September 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20860-2_14

Mathematics Subject Classification ID

Quantum computation (81P68) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65)

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.
• Upper bounds for reversible circuits based on Young subgroups
• Factoring logic functions
• Implementing an arbitrary reversible logic gate

This page was built for publication: Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition