A linear algebraic model of algorithmic-based fault tolerance

Author

Anfinson, Cynthia J. ; Luk, Franklin T.

Author_Institution

Center for Appl. Math., Cornell Univ., Ithaca, NY, USA

fYear

1988

fDate

25-27 May 1988

Firstpage

483

Lastpage

493

Abstract

Algorithm-based fault tolerance provides a means of low-cost error protection in real-time signal-processing environments. A novel linear algebraic interpretation is developed for previously proposed algorithm-based fault-tolerance schemes. The concepts of distance, code space, and the definitions of detection and correction in the vector space R/sup n/ are clarified. Error detection and error correction performances are proved for distance-d+1 codes. It is shown why the correction scheme does not work for general weight vectors, and a novel fast-correction algorithm is derived for a distance-5 code.<>

Keywords

computerised signal processing; error correction codes; error detection codes; fault tolerant computing; real-time systems; algorithmic-based fault tolerance; code space; distance; distance-5 code; error correction performances; error detection; linear algebraic interpretation; low-cost error protection; real-time signal-processing environments; Computer errors; Digital signal processing; Error correction; Error correction codes; Fault tolerance; Matrix decomposition; Protection; Signal processing; Signal processing algorithms; Singular value decomposition;

fLanguage

English

Publisher

ieee

Conference_Titel

Systolic Arrays, 1988., Proceedings of the International Conference on

Conference_Location

San Diego, CA, USA

Print_ISBN

0-8186-8860-2

Type

conf

DOI

10.1109/ARRAYS.1988.18085

Filename

18085