The Complexity of Fault-Tolerant Adder Structures

Abstract

To achieve fault-tolerance property of arithmetic circuits several approaches are possible, that differ in the level of hardware redundancy and the coverage of detectable faults. Among them only two are applicable to design of fast fault-tolerant adders. They exploit the concept of residue code or double-rail code. The complexity comparison of the respective fast fault-tolerant adders will be presented.