Fault Tolerance in Reversible Logic Circuits and Quantum Cost Optimization

Authors

  • Kamaraj Arunachalam Department of Electronics and Communication Engineering, Mepco Schlenk Engineering College Sivakasi, Tamilnadu, India
  • Marichamy Perumalsamy Department of Electronics and Communication Engineering, PSR Engineering College, Sivakasi, Tamilnadu, India
  • Kaviyashri K. Ponnusamy Department of Electronics and Communication Engineering, Mepco Schlenk Engineering College, Sivakasi, Tamilnadu, India

DOI:

https://doi.org/10.31577/cai_2020_5_1099

Keywords:

KMD Gate, controlled V and V gate, ALU, divider and Vedic multiplier

Abstract

Energy dissipation is a prominent factor for the very large scale integrated circuit (VLSI). The reversible logic-based circuit was capable to compute the logic without energy dissipation. Accordingly, reversible circuits are an emerging domain of research based on the low value of energy dissipation. At nano-level design, the critical factor in the logic computing paradigm is the fault. The proposed methodology of fault coverage is powerful for testability. In this article, we target three factors such as fault tolerance, fault coverage and fault detection in the reversible KMD Gates. Our analysis provides good evidence that the minimum test vector covers the 100 % fault coverage and 50 % fault tolerance in KMD Gate. Further, we show a comparison between the quantum equivalent and controlled V and V+ gate in all the types of KMD Gates. The proposed methodology mentions that after controlled V and V+ gate based ALU, divider and Vedic multiplier have a significant reduction in quantum cost. The comparative results of designs such as Vedic multiplier, division unit and ALU are obtained and they are analyzed showing significant improvement in quantum cost.

Downloads

Download data is not yet available.

Downloads

Published

2021-03-25

How to Cite

Arunachalam, K., Perumalsamy, M., & Ponnusamy, K. K. (2021). Fault Tolerance in Reversible Logic Circuits and Quantum Cost Optimization. Computing and Informatics, 39(5), 1099–1116. https://doi.org/10.31577/cai_2020_5_1099