Block implementation of fault-tolerant LMS adaptive FIR filters

Adaptive FIR filters are widely used in a variety of modern digital signal processing application, and with the advancement in VLSI technology, it is now feasible to build fairly complicated multiprocessor systems which can provide the necessary computational power required by some highly demanding real-time signal processing applications. The increased computational power of such systems also makes fault tolerance an even more important issue that needs to be addressed carefully, because a single hardware failure can easily render the whole compuational results useless. Algorithm-based fault tolerance (ABFT), recently developed as an effective high level fault-tolerant technique, employs, in addition to the normal outputs, parity numbers that are related to the outputs. These parities can be used to concurrently detect, and in some cases correct, errors caused by hardware failures. A highly efficient implementation of the encoding scheme based on the weighted checksum code is proposed. It is particularly suitable for block adaptive signal processing, and the computational efficiency of this method is compared with that of the more general weighted checksum code.

[1]  Suku Nair,et al.  General linear codes for fault-tolerant matrix operations on processor arrays , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[2]  J.A. Abraham,et al.  Fault-tolerant matrix arithmetic and signal processing on highly concurrent computing structures , 1986, Proceedings of the IEEE.

[3]  Jacob A. Abraham,et al.  Algorithm-Based Fault Tolerance for Matrix Operations , 1984, IEEE Transactions on Computers.

[4]  Niraj K. Jha,et al.  Algorithm-based fault tolerance for floating-point operations in massively parallel systems , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[5]  Sanjit K. Mitra,et al.  Block implementation of adaptive digital filters , 1981 .