A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits

We present a new lower bound on the number of gates in reversible logic circuits that represent a given reversible logic function, in which the circuits are assumed to consist of general Toffoli gates and have no redundant input/output lines. We make a theoretical comparison of lower bounds, and prove that the proposed bound is better than the previous one. Moreover, experimental results for lower bounds on randomlygenerated reversible logic functions and reversible benchmarks are given. The results also demonstrate that the proposed lower bound is better than the former one. key words: reversible logic circuits, Toffoli gates, lower bound, logic minimization

[1]  Gerhard W. Dueck,et al.  Transformation-based synthesis of networks of Toffoli/Fredkin gates , 2003, CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436).

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

[3]  N. Ranganathan,et al.  Design of reversible sequential circuits optimizing quantum cost, delay, and garbage outputs , 2010, JETC.

[4]  Pawel Kerntopf,et al.  A new heuristic algorithm for reversible logic synthesis , 2004, Proceedings. 41st Design Automation Conference, 2004..

[5]  Masayuki HIGASHIOHNO,et al.  A Lower Bound on the Number of Toffoli Gates in Reversible Logic Circuits , 2012 .

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

[7]  Dmitri Maslov,et al.  A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis , 2011, IEEE Transactions on Computers.

[8]  Morteza Saheb Zamani,et al.  Reversible circuit synthesis using a cycle-based approach , 2010, JETC.

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

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

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

[12]  N. Ranganathan,et al.  Design of efficient reversible logic-based binary and BCD adder circuits , 2013, JETC.

[13]  Gerhard W. Dueck,et al.  Reversible cascades with minimal garbage , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

[16]  Pawel Kerntopf,et al.  Reducing Quantum Cost in Reversible Toffoli Circuits , 2011, ArXiv.

[17]  N. M. Nayeem.  Improved ESOP-based Synthesis of Reversible Logic , 2011 .

[18]  Gerhard W. Dueck,et al.  Reversible Logic Synthesis , 2020, Reversible and DNA Computing.

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

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

[21]  Pawel Kerntopf,et al.  Estimating the quality of complexity measures in heuristics for reversible logic synthesis , 2010, IEEE Congress on Evolutionary Computation.

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