Keywords: fault tolerance, fast adders, arithmetic devices, hardware redundancy, residue code, double-, rail code
Fast fault-tolerant adders
Several measures can be undertaken to achieve fault-tolerance of arithmetic devices. They differ in the level of hardware redundancy and the coverage of detectable faults. The discussion of the possible solutions for fast fault tolerant adders is given in the paper. The hardware complexity growth and latency overhead of various designs with respect to fault-coverage is discussed in the paper. It is shown that the designs of fast fault-tolerant adders based on the concept of residue code or double-rail code are preferable.