Preserving hamming distance in arithmetic and logical operations

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

doi:10.1007/s10836-013-5421-9

Preserving hamming distance in arithmetic and logical operations

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

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	903-907
Number of pages	5
Journal	Journal of Electronic Testing: Theory and Applications (JETTA)
Volume	29
Issue number	6
DOIs	https://doi.org/10.1007/s10836-013-5421-9
State	Published - 1 Dec 2013

Keywords

Fault-tolerance
Hamming distance
Linear error correction codes

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1007/s10836-013-5421-9

Cite this

@article{e52243be72684e8cbc0c18d54ed5773a,

title = "Preserving hamming distance in arithmetic and logical operations",

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.",

keywords = "Fault-tolerance, Hamming distance, Linear error correction codes",

author = "Shlomi Dolev and Sergey Frenkel and Tamir, \{Dan E.\} and Vladimir Sinelnikov",

year = "2013",

month = dec,

day = "1",

doi = "10.1007/s10836-013-5421-9",

language = "English",

volume = "29",

pages = "903--907",

journal = "Journal of Electronic Testing: Theory and Applications (JETTA)",

issn = "0923-8174",

publisher = "Springer Netherlands",

number = "6",

}

TY - JOUR

T1 - Preserving hamming distance in arithmetic and logical operations

AU - Dolev, Shlomi

AU - Frenkel, Sergey

AU - Tamir, Dan E.

AU - Sinelnikov, Vladimir

PY - 2013/12/1

Y1 - 2013/12/1

N2 - 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.

AB - 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.

KW - Fault-tolerance

KW - Hamming distance

KW - Linear error correction codes

UR - https://www.scopus.com/pages/publications/84891634570

U2 - 10.1007/s10836-013-5421-9

DO - 10.1007/s10836-013-5421-9

M3 - Article

AN - SCOPUS:84891634570

SN - 0923-8174

VL - 29

SP - 903

EP - 907

JO - Journal of Electronic Testing: Theory and Applications (JETTA)

JF - Journal of Electronic Testing: Theory and Applications (JETTA)

IS - 6

ER -

Preserving hamming distance in arithmetic and logical operations

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this