Error correction based on redundant Residue Number System

Abstract

In Residue Number System (RNS), a large integer is represented as a set of smaller integers called residues. Redundant Residue Number System (RRNS) is obtained by adding some redundant residues which brings in error detection and error correction capability. This capability makes RRNS a promising way to provide a very fast arithmetic in the field of digital computers. At the receiver, RRNS codes are decoded using Chinese Remainder theorem (CRT). An alternative scheme called Mixed Radix Conversion (MRC) is also used which results in low decoding complexity when compared to CRT. This paper presents a single bit error correction algorithm using RRNS. This algorithm doesn't require table lookup which helps to save memory during implementation. Representative examples are given.