Fault-tolerant computations over replicated finite rings

Author

Imbert, Laurent ; Dimitrov, Vassil S. ; Jullien, Graham A.

Author_Institution

Lab. d´´Informatique, de Robotique et de Microelectronique de Montpellier, CNRS, Montpellier, France

Volume

50

Issue

7

fYear

2003

fDate

7/1/2003 12:00:00 AM

Firstpage

858

Lastpage

864

Abstract

This paper presents a fault-tolerant technique based on the modulus replication residue number system (MRRNS) which allows for modular arithmetic computations over identical channels. In this system, fault tolerance is provided by adding extra computational channels that can be used to redundantly compute the mapped output. An algebraic technique is used to determine the error position in the mapped outputs and provide corrections. We also show that by taking advantage of some elementary polynomial properties we obtain the same level of fault tolerance with about a 30% decrease in the number of channels. This new system is referred to as the symmetric MRRNS (SMRRNS).

Keywords

computational complexity; error correction; error detection; fault tolerant computing; polynomials; residue number systems; algebraic technique; error corrections; error position determination; fault-tolerant computation; mapped outputs; modular arithmetic computations; modulus replication; modulus replication residue number system; parallel algorithms; polynomial properties; replicated finite rings; residue arithmetic; symmetric MRRNS; Arithmetic; Concurrent computing; Cryptography; Error correction; Fault tolerance; Fault tolerant systems; Parallel algorithms; Polynomials; Robots; Signal generators;

fLanguage

English

Journal_Title

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on

Publisher

ieee

ISSN

1057-7122

Type

jour

DOI

10.1109/TCSI.2003.814085

Filename

1211085