Error correction in redundant residue number systems

In this paper, two error-correcting algorithms for redundant residue number systems are presented, one for single residue-error correction and the other for burst residue-error correction. Neither algorithm requires table look-up and hence their implementations need a memory space which is much smaller than that required by existing methods. Furthermore, the conditions which the moduli of the redundant residue number systems must satisfy in these two algorithms are less restrictive than that of existing methods. Comparison of the approach on which these two algorithms are based and that of existing methods is given.