Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor
IEEE Transactions on Computers
Digital signal processing (3rd ed.): principles, algorithms, and applications
Digital signal processing (3rd ed.): principles, algorithms, and applications
Modeling the Effect of Technology Trends on the Soft Error Rate of Combinational Logic
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Improved Fault Coverage for Adaptive Fault Tolerant Filters
ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97)-Volume 3 - Volume 3
The Impact of Technology Scaling on Lifetime Reliability
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Energy-efficient soft error-tolerant digital signal processing
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Toward Increasing FPGA Lifetime
IEEE Transactions on Dependable and Secure Computing
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Hi-index | 0.00 |
Fault-tolerant adaptive filters (FTAFs) rely on inherent learning capabilities of the adaptive process to compensate for transient (soft) or permanent (hard) errors in the hardware implementation. In this paper, the use of the Walsh-Hadamard transform is first analyzed as a computationally efficient way of achieving adaptive fault tolerance, where a zero padding strategy is used to compensate for faulty filter coefficients. It is then shown that a fast-Fourier-transform (FFT)-based transform-domain FTAF operating on real-valued signals can provide a similar degree of fault tolerance without introducing redundancy in the form of zero padding. The complex arithmetic provides inherent fault-tolerant capabilities. This is achieved by using only the real part of the error to drive the coefficient updates. In the case of an N-tap filter, the FFT-based FTAF can protect up to N - 2 filer coefficients.