|
Probabilistic methods for self-correcting hardware design
S. Doleva, S. Frenkelbc, D. E. Tamird a Departmentof Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel
b Moscow Institute of Radio, Electronics, and Automation «MIREA», Moscow 119454, Russian Federation
c Institute of Informatics Problems, Russian Academy of Sciences, Moscow 119333, Russian Federation
d Departmentof Computer Science, Texas State University, San Marcos, TX 78666, USA
Abstract:
This paper presents several ways for extending the scope of program self-correction methods, based on the “random self-reducibility” property, to hardware design. The concept can be utilized for both analog and digital hardware-design. The extension is based on sampling, polynomial-interpolation, and error-correcting codes. In particular, the authors suggest using the well-known reconstruction of real-numerical functions for correcting faults remaining in analog and digital hardware, e. g., arithmetic logic units (ALU), after manufacturing testing. The present approach can complement the state-of-the-art technique of program self-correction by uniformly testing samples of operations and verifying the results of these samples.
Keywords:
self-correcting; real function computation; data analysis; interpolation.
Received: 23.10.2013
Citation:
S. Dolev, S. Frenkel, D. E. Tamir, “Probabilistic methods for self-correcting hardware design”, Inform. Primen., 7:4 (2013), 140–147
Linking options:
https://www.mathnet.ru/eng/ia292 https://www.mathnet.ru/eng/ia/v7/i4/p140
|
|