Open Access Open Access  Restricted Access Subscription or Fee Access

An Efficient Approach to Designing Low Power Reversible Parallel Binary Adder/Subtractor

D. Keerthika, R. Sowndarya, K. Vignesh, R. Sindhuja


In the recent years, Reversible Logic design is attracting more interest due to its low power consumption. Since 1980s Reversible Circuits have gained more attention as components of Quantum algorithms and Nano computing techniques. In this paper, Reversible eight-bit parallel Binary Adder/Subtractor with Design I, Design II and Design III are proposed. Full adders and Subtractors are realized in a single unit in all three designs. Performance analysis is done based on three criteria: number of gates used, Quantum cost and garbage inputs/outputs. Design III of Reversible eight-bit Parallel Binary Adder/Subtractor is found to be more efficient than Design I, Design II and existing design.


Reversible Logic, Garbage Input/output, Quantum Cost, Reversible Parallel Binary Adder/Subtractor.

Full Text:



C H Bennett, (1998) "Notes on the History of Reversible Computation", IBM Journal of Research and Development, vol. 32, pp. 16-23.

R Landauer, (1961) “Irreversibility and Heat Generation in the Computational Process”, IBM Journal of Research and Development, vol. 5, no. 3, pp. 183-191.

C H Bennett, (1973) “Logical Reversibility of Computation”, IBM Journal of Research and Development, vol. 17, no. 6, pp. 525-532.

T Toffoli, (1980) “Reversible Computing”, Technical Memo MIT/LCS/TM-151, MIT Lab for Computer Science.

H Thapliyal and N Ranganathan, (2009) “Design of Efficient Reversible Binary Subtractors Based on a New Reversible Gate”, IEEE Proceedings of the Computer Society Annual Symposium on VLSI, pp. 229-234.

H Thapliyal and N Ranganathan, (2010)“Design of Reversible Latches Optimized for Quantum Cost, Delay and Garbage Outputs”, Proceedings of Twenty Third International Conference on VLSI Design, pp. 235-240.

Lihui Ni, Zhijin Guan, and Wenying Zhu, (2010) “A General Method of Constructing the Reversible FullAdder”, Third International Symposium on Intelligent Information Technology and Security Informatics, pp. 109-113.

Irina Hashmi and Hafiz Md. Hasan Babu, (2010) “An Efficient Design of a Reversible Barrel Shifter”, Twenty Third International Conference on VLSI Design, pp. 93-98.

Robert Wille, Daniel Grobe, D Michael Miller, and Rolf Drechsler, (2009) “Equivalence Checking of Reversible Circuits”, Thirty Ninth International Symposium on Multiple-Valued Logic, pp. 324-330.

Noor Muhammed Nayeem, Md. Adnan Hossain, Lafifa Jamal, and Hafiz Md. Hasan Babu, (2009) “Efficient Design of Shift Registers using Reversible Logic”, International Conference on Signal Processing Systems, pp. 474-478.

Majid Mohammadi, Mohammad Eshghi, Majid Haghparast and Abbas Bahrololoom, (2008) “Design and Optimization of Reversible BCD Adder/Subtractor Circuit for Quantum and Nanotechnology Based Systems”, World Applied Sciences Journal, vol. 4, no. 6, pp. 787-792.

Majid Mohammadi and Mohammad Eshghi, (2008) “Behavioral description of V and V+ gates to Design Quantum Logic Circuits”, Fifth International Multi-Conference on Systems, Signals and Devices, pp. 1-6.

Rekha K James, Shahana T K, K Poulose Jacob, and Sreela Sasi, (2007) “A New Look at Reversible Logic Implementation of Decimal Adder”, The International Symposium on System-On-Chip.

Himanshu Thapliyal and A P Vinod, (2006) “Transistor Realization of Reversible TSG Gate and Reversible Adder Architectures”, Proceedings of IEEE Asia Pacific Conference on Circuits and Systems, pp. 418-421.

Himanshu Thapliyal and M B Srinivas, (2006) “Novel Design and Reversible Logic Synthesis of Multiplexer Based Full Adder and Multipliers”, Forty Eight Midwest Symposium on Circuits and Systems, vol. 2, pp. 1593 – 1596.

Yvan Van Rentergem and Alexis De Vos, (2005) “Optimal Design of a Reversible Full Adder”, International Journal of Unconventional Computing, vol. 1, pp. 339 – 355.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.