Share Email Print

Proceedings Paper

A Theoretical Foundation For The Weighted Checksum Scheme
Author(s): Cynthia J. Anfinson; Richard P. Brent; Franklin T. Luk
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The weighted checksum scheme has been proposed as a low-cost error detection procedure for parallel matrix computations. Error correction has proved to be a much more difficult problem to solve than detection when using weighted checksums. In this paper we provide a theoretical basis for the correction problem. We show that for a distance d+1 weighted checksum scheme, if a maximum of ici [d/2] errors ensue then we can determine exactly how many errors have occurred. We further show that in this case we can correct the errors and give a procedure for doing so.

Paper Details

Date Published: 23 February 1988
PDF: 9 pages
Proc. SPIE 0975, Advanced Algorithms and Architectures for Signal Processing III, (23 February 1988); doi: 10.1117/12.948486
Show Author Affiliations
Cynthia J. Anfinson, Cornell University (United States)
Richard P. Brent, Australian National University (Australia)
Franklin T. Luk, Cornell University (United States)

Published in SPIE Proceedings Vol. 0975:
Advanced Algorithms and Architectures for Signal Processing III
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top