Reversible binary coded decimal adders using toffoli gates

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Reversibility plays a fundamental role when computations with minimal energy dissipation are considered. This research describes Toffoli Gate (TG) implementations of conventional Binary Coded Decimal (BCD) adders, adders for Quick Addition of Decimals (QAD), and carry select BCD adders suitable for multi-digit addition. For an N-digit fast adder, partial parallel processing is done on all digits in the decimal domain. Such high-speed BCD adders find application in realtime processors and internet-based computing. An analysis of delay normalized to a TG and quantum cost of BCD adders is presented. Implementations using TGs and Fredkin Gates (FRGs) are compared based on quantum cost, number of gates, garbage count and delay, and the results are tabulated. © Springer Science+Business Media B.V. 2009.

Cite

CITATION STYLE

APA

James, R. K., Jacob, K. P., & Sasi, S. (2009). Reversible binary coded decimal adders using toffoli gates. In Lecture Notes in Electrical Engineering (Vol. 14 LNEE, pp. 117–131). https://doi.org/10.1007/978-1-4020-8919-0_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free