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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Calcolo Ročník 45; číslo 3; s. 193 - 206
Hlavní autori: Yang, Guowu, Song, Xiaoyu, Hung, William N. N., Perkowski, Marek A., Seo, Chang-Jun
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Milan Springer Milan 01.09.2008
Springer Nature B.V
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia: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