Fault Tolerant Synthesis of Reversible Circuits
A Designers Approach to Realize Fault Tolerant Reversible Circuits
Versandkostenfrei!
Versandfertig in 6-10 Tagen
36,99 €
inkl. MwSt.
PAYBACK Punkte
18 °P sammeln!
History justifies the successful observance of Moore's law on growth of packaging density per unit area. But the growth momentum is not likely to continue in near future due to various intrinsic limitations of conventional computing such as heat dissipation, speed of light, stray capacitance etc. In consequences reversible computing is gaining interest of the researchers due to its low power consumption, high speed and more packaging density. With high packaging density, the circuits may not remain free from faults. Fault Tolerant Synthesis of Reversible Circuits, introduces essentials of faul...
History justifies the successful observance of Moore's law on growth of packaging density per unit area. But the growth momentum is not likely to continue in near future due to various intrinsic limitations of conventional computing such as heat dissipation, speed of light, stray capacitance etc. In consequences reversible computing is gaining interest of the researchers due to its low power consumption, high speed and more packaging density. With high packaging density, the circuits may not remain free from faults. Fault Tolerant Synthesis of Reversible Circuits, introduces essentials of fault tolerance in reversible computing. This book first exploits parity-preserving characteristics of two newly proposed reversible gates which provide low cost parity-preserving based fault tolerance. To extend online testability of reversible circuits, the substitution of reversible gates has been presented. The online testing capabilities of some reversible gates have been identified and allavailable libraries for synthesis have been made online testable. Finally a tool is presented to implement all above substitutions and convert any reversible circuit to fault tolerant reversible circuit.
Andere Kunden interessierten sich für
