Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fault Tolerant Synthesis of Reversible Circuits (1310.5231v2)

Published 19 Oct 2013 in cs.ET and quant-ph

Abstract: Reversible computing has emerged as a possible low cost alternative to conventional computing in terms of speed, power consumption and computing capability. In order to achieve reliable circuits in reversible computing, provision for fault tolerance is necessary. A number of fault models, fault tolerant techniques (such as parity-preserving) and testing approaches have proposed in literature. This dissertation exploits parity-preserving characteristics of two reversible gates which provide low cost parity-preserving based fault tolerance. In order to extend online testability of reversible circuits, the substitution of Peres gate has been presented. The online testing capabilities of MCF including Swap and Fredkin gates were also identifies. Finally a tool was developed to implement all above substitutions and converting any reversible circuit to parity-preserving based fault tolerant circuit.

Citations (2)

Summary

We haven't generated a summary for this paper yet.