Abstract
Reversible circuits implement invertible logic functions. They are of great interest to cryptography, coding theory, interconnect design, computer graphics, quantum computing, and many other fields.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Toffoli gates have bee briefly introduced in Chap. 2. Here, their functionality is presented for the sake of clarity.
- 2.
This holds since self-inverse reversible gates such as Toffoli gates, CNOT gates, NOT gates, etc. are considered here.
References
D. Kamalika, I. Sengupta, Applications of reversible logic in cryptography and coding theory, in Proceedings of the 26th International Conference on VLSI Design (2013)
K. Czarnecki et al., Bidirectional transformations: a cross-discipline perspective, in Theory and Practice of Model Transformations, ed. by R.F. Paige (Springer, Berlin, 2009), pp. 260–283
R. Wille, R. Drechsler, C. Oswald, A. Garcia-Ortiz, Automatic design of low-power encoders using reversible circuit synthesis, in Design, Automation and Test in Europe (DATE) (2012), pp. 1036–1041
S.L. Sunil, C.D. Yoo, T. Kalker, Reversible image watermarking based on integer-to-integer wavelet transform. IEEE Trans. Inf. Forensics Secur. 2(3), 321–330 (2007)
M. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2010)
R. Wille, R. Drechsler, Towards a Design Flow for Reversible Logic (Springer, Berlin, 2010)
R. Drechsler, R. Wille, From truth tables to programming languages: Progress in the design of reversible circuits, in International Symposium on Multiple-Valued Logic (2011), pp. 78–85
M. Saeedi, I.L. Markov, Synthesis and optimization of reversible circuits–a survey. ACM Comput. Surv. (CSUR) 45(2), 21 (2013)
R. Wille et al., Equivalence checking of reversible circuits, in 39th IEEE International Symposium on Multiple-Valued Logic (2009)
S.P. Jordan, Strong equivalence of reversible circuits is coNP-complete. Quantum Inf. Comput. 14(15–16), 1302–1307 (2014)
CryptoMiniSAT tool. http://www.msoos.org/cryptominisat2/
M. Soos, Enhanced Gaussian Elimination in DPLL-based SAT Solvers POS@SAT (2010)
T. Toffoli, Reversible computing, in Automata, Languages and Programming, ed. by W. de Bakker, J. van Leeuwen (Springer, Heidelberg, 1980), p. 632. (Technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci.)
E.F. Fredkin, T. Toffoli, Conservative logic. Int. J. Theor. Phys. 21(3/4), 219–253 (1982)
A. Peres, Reversible logic and quantum computers. Phys. Rev. A 32, 3266–3276 (1985)
A. Biere, M. Heule, H. van Maaren (eds.) Handbook of Satisfiability, vol. 185 (IOS Press, Amsterdam, 2009)
M. Davis, G. Logemann, D. Loveland, A machine program for theorem proving. Commun. ACM 5(7), 394–397 (1962)
S. Yamashita, I.L. Markov. Fast equivalence-checking for quantum circuits, in Proceedings of the 2010 IEEE/ACM International Symposium on Nanoscale Architectures (IEEE Press, Piscataway, 2010)
M. Soos, K. Nohl, C. Castelluccia, Extending SAT solvers to cryptographic problems, Theory and Applications of Satisfiability Testing-SAT 2009 (Springer, Berlin, 2009), pp. 244–257
D. Brand, Verification of large synthesized designs, in Proceedings of the ICCAD (1993), pp. 534–537
G.S. Tseitin, On the Complexity of Derivation in Propositional Calculus, Automation of Reasoning (Springer, Berlin, 1983)
Reversible CEC flow and experiments of this work. http://lsi.epfl.ch/RCEC
R. Wille, D. Große, L. Teuber, G.W. Dueck, R. Drechsler, RevLib: an online resource for reversible functions and reversible circuits, in International Symposium on Multiple-Valued Logic, RevLib is (2008). http://www.revlib.org, pp. 220–225
MiniSat: open-source SAT solver. http://minisat.se
D.M. Miller, R. Wille, G.W. Dueck, Synthesizing reversible circuits for irreversible functions, in: Euromicro Conference on Digital System Design (DSD) (2009), pp. 749–756
R. Wille, O. Keszöcze, R. Drechsler, Determining the minimal number of lines for large reversible circuits, in Design, Automation and Test in Europe (DATE) (2011)
Y. Hamadi et al., ManySAT: a parallel SAT solver. J. Satisf. Boolean Model. Comput. 6, 245–262 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Amaru, L.G. (2017). Improvements to the Equivalence Checking of Reversible Circuits. In: New Data Structures and Algorithms for Logic Synthesis and Verification. Springer, Cham. https://doi.org/10.1007/978-3-319-43174-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-43174-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-43173-4
Online ISBN: 978-3-319-43174-1
eBook Packages: EngineeringEngineering (R0)