loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07)
On the Behavior of Substitution-based Reversible Circuit Synthesis Algorithms: Investigation and Improvement
Porto Alegre, Brazil
March 09-March 11
ISBN: 0-7695-2896-1
Mehdi Saeedi, Amirkabir University of Technology, Iran
Morteza Saheb Zamani, Amirkabir University of Technology, Iran
Mehdi Sedighi, Amirkabir University of Technology, Iran
In this paper, the behavior of substitution-based reversible circuit synthesis methods is studied. We analyze one of the most recent search-based synthesis algorithms to improve its quality by adding some new non-trivial substitutions. Furthermore, it is shown that the order of factor substitution affects the depth of search tree significantly. In addition, we consider the number of terms in positive polarity Reed-Muller (PPRM) expansions during factor substitution to show that some local increases in the number of terms may lead to better final synthesis results. Besides, the behavior of depth-first search (DFS) and breadth-first search (BFS) synthesis algorithms are investigated. It is demonstrated that BFS has more effects on the quality of results and sometimes leads to shorter runtime. Based on these properties, a new hybrid DFS/BFS synthesis algorithm is proposed. Our experiments show the efficiency of this algorithm.
Citation:
Mehdi Saeedi, Morteza Saheb Zamani, Mehdi Sedighi, "On the Behavior of Substitution-based Reversible Circuit Synthesis Algorithms: Investigation and Improvement," isvlsi, pp.428-436, IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.