Optimal Reversible Logic Circuit Synthesis Based on a Hybrid DFS-BFS Technique

Logic synthesis with reversible circuits has received considerable interest in the light of advances recently made in quantum computation. In this paper, we propose an improved technique for synthesizing reversible circuits based on a combined depth-first search (DFS) and breadth-first search (BFS) algorithm. A method based on DFS alone may often take a long time to converge, whereas, a BFS based method requires a large amount of memory for designing a circuit of moderate complexity. To strike a balance between these two approaches, we propose a hybrid DFS-BFS based synthesis algorithm that reduces the computation time compared to the DFS method and requires less space compared to the BFS method, while optimizing the cost of the circuit. Synthesis results on several reversible benchmark circuits have been reported.

[1]  Niraj K. Jha,et al.  An Algorithm for Synthesis of Reversible Logic Circuits , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Morteza Saheb Zamani,et al.  On the Behavior of Substitution-based Reversible Circuit Synthesis Algorithms: Investigation and Improvement , 2007, IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07).

[3]  Yahiko Kambayashi,et al.  Transformation rules for designing CNOT-based quantum circuits , 2002, DAC '02.

[4]  Anas N. Al-Rabadi,et al.  Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits , 2001 .

[5]  Gerhard W. Dueck,et al.  Techniques for the synthesis of reversible Toffoli networks , 2006, TODE.

[6]  Guowu Yang,et al.  A Constructive Algorithm for Reversible Logic Synthesis , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[7]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[8]  Morteza Saheb Zamani,et al.  A novel synthesis algorithm for reversible circuits , 2007, ICCAD 2007.

[9]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[10]  R. Merkle.  Reversible electronic logic using switches , 1993 .

[11]  Ralph C. Merkle,et al.  Two types of mechanical reversible logic , 1993 .

[12]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[13]  Alan Mishchenko,et al.  Logic Synthesis of Reversible Wave Cascades , 2002, IWLS.

[14]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[15]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[16]  John P. Hayes,et al.  Synthesis of reversible logic circuits , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Charles H. Bennett.  Notes on the history of reversible computation , 2000, IBM J. Res. Dev..

[18]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[19]  R. Feynman.  Quantum mechanical computers , 1986 .

[20]  Gerhard W. Dueck,et al.  Spectral Techniques for Reversible Logic Synthesis , 2002 .

[21]  N. Gershenfeld,et al.  Quantum Computing with Molecules , 1998 .

[22]  D. M. Miller.  Spectral and two-place decomposition techniques in reversible logic , 2002, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002..