Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

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).
Document type :
Journal articles
Complete list of metadata
Contributor : Christine Carvalho De Matos Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2008 - 8:21:52 AM
Last modification on : Friday, October 22, 2021 - 3:07:18 PM




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⟩



Record views