Analysis and Improvement of Transformation-Based Reversible Logic Synthesis

Ultra-low power dissipation for nanoscale circuits and future technologies such as quantum computing require reversible logic. Existing methods of reversible logic synthesis attempt to minimize gate count, quantum cost, garbage count and try to achieve scalability for large Boolean functions. Several notable heuristics for reversible logic synthesis employ a method based on repeated transformation, demonstrating excellent performance compared to available optimal results. In this paper, we suggest two novel techniques to the transformation-based synthesis flow for improving synthesis outcome. The first technique is based on properties of Boolean functions and the second technique incorporates generalized Fredkin gates during synthesis flow. We present theoretical results and experimental evidence in support of our strategies.

[1]  Gerhard W. Dueck,et al.  IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION ( VLSI ) SYSTEMS , VOL . ? ? ? , NO . ? ? ? , ? ? ? , 2003 .

[2]  Guowu Yang,et al.  Group Theory Based Synthesis of Binary Reversible Circuits , 2006, TAMC.

[3]  ESOP-Based Toffoli Network Generation with Transformations , 2010, 2010 40th IEEE International Symposium on Multiple-Valued Logic.

[4]  Timo Neumann,et al.  BENT FUNCTIONS , 2006 .

[5]  Igor L. Markov,et al.  Synthesis and optimization of reversible circuits—a survey , 2011, CSUR.

[6]  Gerhard W. Dueck,et al.  A transformation based algorithm for reversible logic synthesis , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[7]  Robert Wille,et al.  BDD-based synthesis of reversible logic for large functions , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[8]  Selçuk Kavut,et al.  9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class , 2010, Inf. Comput..

[9]  Leo Storme,et al.  Group Theoretical Aspects of Reversible Logic Gates , 1999, J. Univers. Comput. Sci..

[10]  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.

[11]  O. S. Rothaus,et al.  On "Bent" Functions , 1976, J. Comb. Theory, Ser. A.

[12]  K. N. Patel,et al.  Efficient Synthesis of Linear Reversible Circuits , 2003 .

[13]  Robert Wille,et al.  Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Selçuk Kavut,et al.  Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class , 2007, IEEE Transactions on Information Theory.

[15]  Stefan Frehse,et al.  RevKit: A Toolkit for Reversible Circuit Design , 2012, J. Multiple Valued Log. Soft Comput..

[16]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

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

[18]  Gerhard W. Dueck,et al.  Toffoli network synthesis with templates , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  John P. Hayes,et al.  Reversible logic circuit synthesis , 2002, IWLS.

[20]  Dmitri Maslov,et al.  Synthesis of the optimal 4-bit reversible circuits , 2010, Design Automation Conference.

[21]  Chao Huang,et al.  A novel Toffoli network synthesis algorithm for reversible logic , 2009, 2009 Asia and South Pacific Design Automation Conference.