Synthesis of reversible circuits with minimal costs

We present fast algorithms to synthesize exact minimal reversible circuits for various types of gate and cost. By reducing reversible logic synthesis problems to permutation group problems, we use the powerful algebraic software GAP to solve such problems. Our approach can minimize for arbitrary cos...

Full description

Saved in:
Bibliographic Details
Published in:Calcolo Vol. 45; no. 3; pp. 193 - 206
Main Authors: Yang, Guowu, Song, Xiaoyu, Hung, William N. N., Perkowski, Marek A., Seo, Chang-Jun
Format: Journal Article
Language:English
Published: Milan Springer Milan 01.09.2008
Springer Nature B.V
Subjects:
Algebra
Algorithms
Electronics
Logic
Mathematics
Mathematics and Statistics
Numerical Analysis
Software
Theory of Computation
discrete mathematics in relation to computer science
Circuits
application of Boolean algebra
68R05
Boolean function
networks
94C10
switching theory
combinatorics
ISSN:0008-0624, 1126-5434
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present fast algorithms to synthesize exact minimal reversible circuits for various types of gate and cost. By reducing reversible logic synthesis problems to permutation group problems, we use the powerful algebraic software GAP to solve such problems. Our approach can minimize for arbitrary cost functions of gates. In addition, we show that Peres gates are a better choice than the standard Toffoli gates in libraries of universal reversible gates.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0008-0624
1126-5434
DOI:10.1007/s10092-008-0150-7