A new reversible circuit synthesis algorithm based on cycle representations of permutations

2015 ◽  
Vol 50 ◽  
pp. 187-192 ◽  
Author(s):  
A.C. Ribeiro ◽  
L.A.B. Kowada ◽  
F.L. Marquezino ◽  
C.M.H. Figueiredo
Keyword(s):  
Circuit Synthesis ◽  
Synthesis Algorithm ◽  
Reversible Circuit

A Novel Efficient Optimal Reversible Circuit Synthesis Algorithm

2015 ◽  
Author(s):  
Yu-Shan Yang ◽  
Han-Kuan Chen ◽  
Shu-Yu Kuo ◽  
Guo-Jyun Zeng ◽  
Yao-Hsin Chou
Keyword(s):  
Circuit Synthesis ◽  
Synthesis Algorithm ◽  
Reversible Circuit

scholarly journals A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates

2021 ◽  
Vol 27 (6) ◽  
pp. 544-563
Author(s):  
Edinelço Dalcumune ◽  
Luis Antonio Brasil Kowada ◽  
André da Cunha Ribeiro ◽  
Celina Miraglia Herrera de Figueiredo ◽  
Franklin de Lima Marquezino
Keyword(s):  
Low Cost ◽  
Progressive Increase ◽  
Experimental Results ◽  
Circuit Synthesis ◽  
Synthesis Algorithm ◽  
Disjoint Cycles ◽  
Gate Count ◽  
Reversible Circuit ◽  
Toffoli Gates ◽  
Negative Controls

We present a new algorithm for synthesis of reversible circuits for arbitrary n-bit bijective functions. This algorithm uses generalized Toffoli gates, which include positive and negative controls. Our algorithm is divided into two parts. First, we use partially controlled gen- eralized Toffoli gates, progressively increasing the number of controls. Second, exploring the properties of the representation of permutations in disjoint cycles, we apply generalized Toffoli gates with controls on all lines except for the target line. Therefore, new in the method is the fact that the obtained circuits use first low cost gates and consider increasing costs towards the end of the synthesis. In addition, we employ two bidirectional synthesis strategies to improve the gate count, which is the metric used to compare the results obtained by our algorithm with the results presented in the literature. Accordingly, our experimental results consider all 3-bit bijective functions and twenty widely used benchmark functions. The results obtained by our synthesis algorithm are competitive when compared with the best results known in the literature, considering as a complexity metric just the number of gates, as done by alternative best heuristics found in the literature. For example, for all 3-bit bijective functions using generalized Toffoli gates library, we obtained the best so far average count of 5.23.

Minimal reversible circuit synthesis on a DNA computer

2016 ◽  
Vol 16 (3) ◽  
pp. 463-472 ◽  
Author(s):  
Mayukh Sarkar ◽  
Prasun Ghosal ◽  
Saraju P. Mohanty
Keyword(s):  
Circuit Synthesis ◽  
Reversible Circuit ◽  
Dna Computer

scholarly journals Depth-optimized reversible circuit synthesis

2012 ◽  
Vol 12 (4) ◽  
pp. 1677-1699 ◽  
Author(s):  
Mona Arabzadeh ◽  
Morteza Saheb Zamani ◽  
Mehdi Sedighi ◽  
Mehdi Saeedi
Keyword(s):  
Circuit Synthesis ◽  
Reversible Circuit

Identifying Reversible Circuit Synthesis Approaches to Enable IP Piracy Attacks

2017 ◽  
Author(s):  
Samah Saeed ◽  
Nithin Mahendran ◽  
Alwin Zulehner ◽  
Robert Wille ◽  
Ramesh Karri
Keyword(s):  
Circuit Synthesis ◽  
Reversible Circuit ◽  
Ip Piracy
Sign in / Sign up

Export Citation Format

Share Document