Share Email Print

Proceedings Paper

Fault-Tolerant Systems For The Computation Of Eigenvalues And Singular Values
Author(s): Chien-Yi Chen; Jacob A. Abraham
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The computations of eigenvalues and singular values are key to applications including signal and image processing. Since large amounts of computation are needed for these algorithms, and since many digital signal processing applications have real-time requirements, many different special-purpose processor array structures have been proposed to solve these two algorithms. This paper develops a new methodology to incorporate fault tolerance capability into processor arrays which have been proposed for these problems. In the first part of this paper, earlier techniques of algorithm-based fault tolerance are applied to QR factorization and QR iteration. This technique encodes input data at a high level by using the specific property of each algorithm and checks the output data before they leave the systems. In the second part of the paper, special properities of eigenvalues and singular values are used to achieve the error detection without encoding the input data. Fault location and reconfiguration are performed only after an erroneous signal has been detected. The introduced overhead is extremely low in terms of both hardware and time redundancy.

Paper Details

Date Published: 4 April 1986
PDF: 10 pages
Proc. SPIE 0696, Advanced Algorithms and Architectures for Signal Processing I, (4 April 1986); doi: 10.1117/12.936897
Show Author Affiliations
Chien-Yi Chen, University of Illinois (United States)
Jacob A. Abraham, University of Illinois (United States)

Published in SPIE Proceedings Vol. 0696:
Advanced Algorithms and Architectures for Signal Processing I
Jeffrey M. Speiser, Editor(s)

© SPIE. Terms of Use
Back to Top