NEW ENCODING DECODING METHODS FOR DESIGNING FAULT-TOLERANT MATRIX OPERATIONS/

Citation
Dl. Tao et al., NEW ENCODING DECODING METHODS FOR DESIGNING FAULT-TOLERANT MATRIX OPERATIONS/, IEEE transactions on parallel and distributed systems, 7(9), 1996, pp. 931-938
Citations number
19
Categorie Soggetti
System Science","Engineering, Eletrical & Electronic","Computer Science Theory & Methods
ISSN journal
10459219
Volume
7
Issue
9
Year of publication
1996
Pages
931 - 938
Database
ISI
SICI code
1045-9219(1996)7:9<931:NEDMFD>2.0.ZU;2-M
Abstract
Algorithm-based fault tolerance (ABFT) can provide a low-cost error pr otection for array processors and multiprocessor systems. Several ABFT techniques (weighted check-sum) have been proposed to design fault-to lerant matrix operations. In these schemes, encoding/decoding uses eit her multiplications or divisions so that overhead is high. In this pap er, new encoding/decoding methods are proposed for designing fault-tol erant matrix operations. The unique feature of these new methods is th at only additions and subtractions are used in encoding/decoding. In t his paper, new algorithms are proposed to construct error detecting/co rrecting codes with the minimum Hamming distance 3 and 4. We will show that the overhead introduced due to the incorporation of fault tolera nce is drastically reduced by using these new coding schemes.