On the Behavior of Substitution-based Reversible Circuit Synthesis Algorithms: Investigation and Improvement

Authors:
Mehdi Saeedi;Morteza Saheb Zamani;Mehdi Sedighi
Affiliations:
Amirkabir University of Technology, Iran;Amirkabir University of Technology, Iran;Amirkabir University of Technology, Iran
Venue:
ISVLSI '07 Proceedings of the IEEE Computer Society Annual Symposium on VLSI
Year:
2007

Citing 0
Cited 7

A novel synthesis algorithm for reversible circuits

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Moving forward: a non-search based synthesis method toward efficient CNOT-based quantum circuit synthesis algorithms

Proceedings of the 2008 Asia and South Pacific Design Automation Conference
A cycle-based synthesis algorithm for reversible logic

Proceedings of the 2009 Asia and South Pacific Design Automation Conference
A Novel Transformation-Based Algorithm for Reversible Logic Synthesis

ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
A library-based synthesis methodology for reversible logic

Microelectronics Journal
Synthesis of the optimal 4-bit reversible circuits

Proceedings of the 47th Design Automation Conference
Rule-based optimization of reversible circuits

Proceedings of the 2010 Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.