FPGA Fault Tolerant Arithmetic Logic: A Case Study Using Parallel-Prefix Adders

Abstract

This paper examines fault tolerant adder designs implemented on FPGAs which are inspired by the methods of modular redundancy, roving, and gradual degradation. A parallel-prefix adder based upon the Kogge-Stone configuration is compared with the simple ripple carry adder (RCA) design. The Kogge-Stone design utilizes a sparse carry tree complemented by several smaller RCAs. Additional RCAs are inserted into the design to allow fault tolerance to be achieved using the established methods of roving and gradual degradation. A triple modular redundant ripple carry adder (TMR-RCA) is used as a point of reference. Simulation and experimental measurements on a Xilinx Spartan 3E FPGA platform are carried out. The TMR-RCA is found to have the best delay performance and most efficient resource utilization for an FPGA fault-tolerant implementation due to the simplicity of the approach and the use of the fast-carry chain. However, the superior performance of the carry-tree adder over an RCA in a VLSI implementation makes this proposed approach attractive for ASIC designs.

Efficient implementation of bit‐parallel fault tolerant polynomial basis multiplication and squaring over GF(2 m )

“…The Roving fault tolerance method is based on the strategy of detecting faulty parts in the structures with similar functionality parts [23, 24]. In [25, 26] a Roving fault tolerant sparse Kogge–Stone adder is presented. The adder is constructed by using three parts of generate and propagate, sparse Kogge–Stone carry tree, and four modular independent Ripple Carry Adders (RCA).…”