Preserving Hamming Distance in Arithmetic and Logical Operations

  • Authors:
  • Shlomi Dolev;Sergey Frenkel;Dan E. Tamir;Vladimir Sinelnikov

  • Affiliations:
  • Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Institute of Information Problems, Russian Academy of Sciences, Moscow, Russia;Department of Computer Science, Texas State University, San Marcos, USA;Holon Institute of Technology, Holon, Israel

  • Venue:
  • Journal of Electronic Testing: Theory and Applications
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.