Abstract
We present a reversible, in-place carry-lookahead adder that uses fewer ancillae than previous designs. Specifically, an N-bit adder uses only roughly N ancillae, where previous designs have used roughly 2N ancillae. The cost is 20% higher gate count and 50% higher gate delay.
This work was partially supported by the European COST Action IC 1405: Reversible Computation - Extending Horizons of Computing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Draper, T.G., Kutin, S.A., Rains, E.M., Svore, K.M.: A logarithmic-depth quantum carry-lookahead adder. Quantum Info. Comput. 6(4), 351–369 (2006)
Mogensen, T.Æ.: Garbage-free reversible multiplication and division. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 253–268. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99498-7_18
Rosenberger, G.B.: Simultaneous carry adder. US Patent 2,966,305A (1957)
Thapliyal, H., Jayashree, H.V., Nagamani, A.N., Arabnia, H.R.: Progress in reversible processor design: a novel methodology for reversible carry look-ahead adder. Trans. Comput. Sci. 17, 73–97 (2013)
Van Rentergem, Y., De Vos, A.: Optimal design of a reversible full adder. Int. J. Unconventional Comput. 1, 339–355 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Mogensen, T.Æ. (2019). Reversible In-Place Carry-Lookahead Addition with Few Ancillae. In: Thomsen, M., Soeken, M. (eds) Reversible Computation. RC 2019. Lecture Notes in Computer Science(), vol 11497. Springer, Cham. https://doi.org/10.1007/978-3-030-21500-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-21500-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21499-9
Online ISBN: 978-3-030-21500-2
eBook Packages: Computer ScienceComputer Science (R0)