Title: Fast fault-tolerant adders

Authors: Janusz Biernat

Addresses: Institute of Computer Engineering, Automatics and Robotics, Wroclaw University of Technology, Wybrzeze St.Wyspianskiego 27, 50-370 Wroclaw, Poland

Abstract: 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.

Keywords: fault tolerance; fast adders; arithmetic devices; hardware redundancy; residue code; double-rail code.

DOI: 10.1504/IJCCBS.2010.031709

International Journal of Critical Computer-Based Systems, 2010 Vol.1 No.1/2/3, pp.117 - 127

Published online: 21 Feb 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article