Abstract
All classical logic circuits are physically irreversible, because these circuits comprise irreversible logic. With irreversible logic, all the energy transferred by the power supply is finally converted into heat. Irreversible logic does not allow traverse the state sequences in the reverse direction to gain the initial state after the end of logical computation. This chapter discusses different aspects of both irreversible and reversible logic gates.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M.M. Mano, Digital Design (Prentice Hall, 2005)
R. Landauer, Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183–191 (1961)
C.S. Lent, M. Liu, Y. Lu, Bennett clocking of quantum-dot cellular automata and the limits to binary logic scaling. Nanotechnology 17(16), 4240 (2006)
A. Berut, A. Arakelyan, A. Petrosyan, S. Ciliberto, R. Dillenschneider, E. Lutz, Experimental verification of Landauer’s principle linking information and thermodynamics. Nature 483(7388), 187–189 (2012)
A.O. Orlov, C.S. Lent, C.C. Thorpe, G.P. Boechler, G.L. Snider, Experimental test of Landauers principle at the sub-KBT level. Jpn. J. Appl. Phys. 51(6S), 06FE10 (2012)
T. Toffoli, Reversible computing (Springer, Berlin, 1980), pp. 632–644
E. Fredkin, T. Toffoli, Conservative logic. Int. J. Theor. Phys. 21(3), 219–253 (1982)
A. Peres, Reversible logic and quantum computers. Phys. Rev. A 32, 3266–3276 (1985)
R.P. Feynman, Quantum mechanical computers. Found. Phys. 16(6), 507–531 (1986)
I.L.C.M.A. Nielsen, Quantum Computation and Quantum Information (Cambridge University Press, 2000)
P.A.M. Dirac, A new notation for quantum mechanics. Math. Proc. Cambridge Philos. Soc. 35(3), 416–418 (1939)
D. Maslov, D.M. Miller, Comparison of the cost metrics for reversible and quantum logic synthesis. IET Comput. Dig. Techn.
W.N.N. Hung, X. Song, G. Yang, J. Yang, M. Perkowski, Optimal synthesis of multiple output boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(9), 1652–1663 (2006)
D. Maslov, G.W. Dueck, Reversible cascades with minimal garbage. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(11), 1497–1509 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Sasamal, T.N., Singh, A.K., Mohan, A. (2020). Fundamental of Reversible Logic. In: Quantum-Dot Cellular Automata Based Digital Logic Circuits: A Design Perspective. Studies in Computational Intelligence, vol 879. Springer, Singapore. https://doi.org/10.1007/978-981-15-1823-2_3
Download citation
DOI: https://doi.org/10.1007/978-981-15-1823-2_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-1822-5
Online ISBN: 978-981-15-1823-2
eBook Packages: EngineeringEngineering (R0)