Preserving hamming distance in arithmetic and logical operations

Shlomi Dolev, Sergey Frenkel, Dan E. Tamir, Vladimir Sinelnikov

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

This paper presents a new method for fault-tolerant computing where for a given error rate, r, the hamming distance between correct inputs and faulty inputs, as well as the hamming distance between correct results and faulty results, is preserved throughout processing; thereby enabling correction of up to r transient faults per computation cycle. The new method is compared and contrasted with current protection methods and its cost/performance is analyzed.

Original languageEnglish
Pages (from-to)903-907
Number of pages5
JournalJournal of Electronic Testing: Theory and Applications (JETTA)
Volume29
Issue number6
DOIs
StatePublished - Dec 2013
Externally publishedYes

Keywords

  • Fault-tolerance
  • Hamming distance
  • Linear error correction codes

Fingerprint

Dive into the research topics of 'Preserving hamming distance in arithmetic and logical operations'. Together they form a unique fingerprint.

Cite this