Error correction in redundant residue number systems

S. S. Yau; Y. C. Liu

doi:10.1109/ARITH.1972.6153890

Error correction in redundant residue number systems

Research output: Contribution to conference › Paper › peer-review

Abstract

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.

Original language	English (US)
DOIs	https://doi.org/10.1109/ARITH.1972.6153890
State	Published - 1972
Externally published	Yes
Event	2nd IEEE Symposium on Computer Arithmetic, ARITH 1972 - College Park, United States Duration: May 15 1972 → May 16 1972

Conference

Conference	2nd IEEE Symposium on Computer Arithmetic, ARITH 1972
Country/Territory	United States
City	College Park
Period	5/15/72 → 5/16/72

Keywords

Algorithms
Burst residue-errors
Conditions for moduli
Error correction
Memory requirement
Redundant residue number systems
Single residue-errors
Speed

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture

Access to Document

10.1109/ARITH.1972.6153890

Cite this

@conference{e09f27a29cce467eb3e17117e05d20e2,

title = "Error correction in redundant residue number systems",

abstract = "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.",

keywords = "Algorithms, Burst residue-errors, Conditions for moduli, Error correction, Memory requirement, Redundant residue number systems, Single residue-errors, Speed",

author = "Yau, {S. S.} and Liu, {Y. C.}",

note = "Publisher Copyright: {\textcopyright} 1972 IEEE. Copyright: Copyright 2019 Elsevier B.V., All rights reserved.; 2nd IEEE Symposium on Computer Arithmetic, ARITH 1972 ; Conference date: 15-05-1972 Through 16-05-1972",

year = "1972",

doi = "10.1109/ARITH.1972.6153890",

language = "English (US)",

}

TY - CONF

T1 - Error correction in redundant residue number systems

AU - Yau, S. S.

AU - Liu, Y. C.

PY - 1972

Y1 - 1972

N2 - 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.

AB - 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.

KW - Algorithms

KW - Burst residue-errors

KW - Conditions for moduli

KW - Error correction

KW - Memory requirement

KW - Redundant residue number systems

KW - Single residue-errors

KW - Speed

UR - http://www.scopus.com/inward/record.url?scp=85066613888&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066613888&partnerID=8YFLogxK

U2 - 10.1109/ARITH.1972.6153890

DO - 10.1109/ARITH.1972.6153890

M3 - Paper

AN - SCOPUS:85066613888

T2 - 2nd IEEE Symposium on Computer Arithmetic, ARITH 1972

Y2 - 15 May 1972 through 16 May 1972

ER -

Error correction in redundant residue number systems

Abstract

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this