An ESOP-Based Reversible Circuit Synthesis Flow Using Simulated Annealing

2014 ◽  
pp. 131-144 ◽  
Author(s):  
Kamalika Datta ◽  
Alhaad Gokhale ◽  
Indranil Sengupta ◽  
Hafizur Rahaman
Keyword(s):  
Simulated Annealing ◽  
Circuit Synthesis ◽  
Reversible Circuit

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

TIGHT BOUNDS ON THE SYNTHESIS OF 3-BIT REVERSIBLE CIRCUITS: NFFr LIBRARY

2014 ◽  
Vol 23 (03) ◽  
pp. 1450040 ◽  
Author(s):  
AHMED YOUNES
Keyword(s):  
Lower Bound ◽  
Permutation Group ◽  
Minimum Cost ◽  
Synthesis Problem ◽  
Minimum Length ◽  
Circuit Synthesis ◽  
Generating Set ◽  
Reversible Circuits ◽  
Reversible Circuit ◽  
The Cost

The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier–Sims algorithm for the strong generating set-finding problem to be used to find tight bounds on the synthesis of 3-bit reversible circuits using the NFFr library. The tight bounds include the maximum and minimum length of 3-bit reversible circuits, the maximum and minimum cost of 3-bit reversible circuits. The analysis shows better results than that found in the literature for the lower bound of the cost. The analysis also shows that there are 2460 universal reversible sub-libraries from the main NFFr library.

Sign in / Sign up

Export Citation Format

Share Document