Fault-Tolerant Computations over Replicated Finite Rings

Laurent Imbert 1 V.S. Dimitrov 2 Graham A. Jullien 2
1 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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).
Type de document :
Article dans une revue
IEEE Transactions on Circuits and Systems Part 1 Fundamental Theory and Applications, Institute of Electrical and Electronics Engineers (IEEE), 2003, 50 (7), pp.858-864. 〈10.1109/TCSI.2003.814085〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00269574
Contributeur : Christine Carvalho de Matos <>
Soumis le : jeudi 3 avril 2008 - 08:21:52
Dernière modification le : jeudi 11 janvier 2018 - 06:26:07

Identifiants

Collections

Citation

Laurent Imbert, V.S. Dimitrov, Graham A. Jullien. Fault-Tolerant Computations over Replicated Finite Rings. IEEE Transactions on Circuits and Systems Part 1 Fundamental Theory and Applications, Institute of Electrical and Electronics Engineers (IEEE), 2003, 50 (7), pp.858-864. 〈10.1109/TCSI.2003.814085〉. 〈lirmm-00269574〉

Partager

Métriques

Consultations de la notice

42