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 lookup, and hence their implementation needs a memory space which is much smaller than that required by existing methods. The conditions which the moduli of the redundant residue number systems must satisfy for single residue-error correction 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.
|Original language||English (US)|
|Number of pages||7|
|Journal||IEEE Transactions on Computers|
|Publication status||Published - Jan 1973|
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering