Redundant Residue Number System Based Multiple Error Detection and Correction Using Chinese Remainder Theorem (CRT)

Idris Abiodun Aremu,Kazeem Alagbe Gbolagade

doi:10.11648/j.se.20170505.12

Idris Abiodun Aremu, Kazeem Alagbe Gbolagade

Open Access

https://doi.org/10.11648/j.se.20170505.12

Copy DOI

Journal: Software Engineering	Publication Date: Jan 1, 2017
Citations: 5	License type: cc-by

Affiliation: Kwara State University

Abstract

During the last decade information security and reliable communication is unavoidable in information processing. Residue Number Systems (RNS) are still attracting considerable attention from the research community in digital signal processing. In this paper a new low cost method for multiple error detection and correction based on the Redundant Residue Number System (RRNS) was exhibited. RRNS is obtained by adding some redundant residues which brings in error detection and error correction competence. The proposed multiple error correction scheme exploit the Chinese Remainder Theorem (CRT) together with a novel algorithm that significantly simplifies the error correcting process for integers. The result is slightly different from the current state of the art whereby the error value is estimated using optimization algorithm such as integer programming and the proposed multiple error correction schemes does not require complex iterations in order to correct the errors.

Highlights

IntroductionInformation security has become a major issue [1]. Reliable communication and information security has been more important during the last one decade
The two algorithm does not requires table lookup, but their implementation require memory space which is much smaller than that required by existing methods [2], [3] Watson and Hasting proposed residue arithmetic which was use for general-purpose digital computers to detect and correct their own arithmetic and data-transmission errors. This approach was based on special properties inherent in a suitably chosen redundant residue number system (RRNS). [4] A coding theory approach to error control in redundant residue number systems (RRNSs) was presented
A number X within the dynamic range can be represented by the list of its residues with respect to the moduli defined in the moduli set

Summary

Introduction

Information security has become a major issue [1]. Reliable communication and information security has been more important during the last one decade. The two algorithm does not requires table lookup, but their implementation require memory space which is much smaller than that required by existing methods [2], [3] Watson and Hasting proposed residue arithmetic which was use for general-purpose digital computers to detect and correct their own arithmetic and data-transmission errors. This approach was based on special properties inherent in a suitably chosen redundant residue number system (RRNS).

Residue Number Systems

Redundant Residue Number System

Choice of Moduli

Proposed Improved Scheme

Findings

Conclusion