Error correction in redundant residue number systems

Sik-Sang Yau, Y. C. Liu

Research output: Contribution to conferencePaper

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 languageEnglish (US)
DOIs
StatePublished - Jan 1 1972
Externally publishedYes
Event2nd IEEE Symposium on Computer Arithmetic, ARITH 1972 - College Park, United States
Duration: May 15 1972May 16 1972

Conference

Conference2nd IEEE Symposium on Computer Arithmetic, ARITH 1972
CountryUnited States
CityCollege Park
Period5/15/725/16/72

Fingerprint

Residue number System
Numbering systems
Error correction
Error Correction
Look-up Table
Burst
Modulus
Data storage equipment

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

Cite this

Yau, S-S., & Liu, Y. C. (1972). Error correction in redundant residue number systems. Paper presented at 2nd IEEE Symposium on Computer Arithmetic, ARITH 1972, College Park, United States. https://doi.org/10.1109/ARITH.1972.6153890

Error correction in redundant residue number systems. / Yau, Sik-Sang; Liu, Y. C.

1972. Paper presented at 2nd IEEE Symposium on Computer Arithmetic, ARITH 1972, College Park, United States.

Research output: Contribution to conferencePaper

Yau, S-S & Liu, YC 1972, 'Error correction in redundant residue number systems' Paper presented at 2nd IEEE Symposium on Computer Arithmetic, ARITH 1972, College Park, United States, 5/15/72 - 5/16/72, . https://doi.org/10.1109/ARITH.1972.6153890
Yau S-S, Liu YC. Error correction in redundant residue number systems. 1972. Paper presented at 2nd IEEE Symposium on Computer Arithmetic, ARITH 1972, College Park, United States. https://doi.org/10.1109/ARITH.1972.6153890
Yau, Sik-Sang ; Liu, Y. C. / Error correction in redundant residue number systems. Paper presented at 2nd IEEE Symposium on Computer Arithmetic, ARITH 1972, College Park, United States.
@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 = "Sik-Sang Yau and Liu, {Y. C.}",
year = "1972",
month = "1",
day = "1",
doi = "10.1109/ARITH.1972.6153890",
language = "English (US)",
note = "2nd IEEE Symposium on Computer Arithmetic, ARITH 1972 ; Conference date: 15-05-1972 Through 16-05-1972",

}

TY - CONF

T1 - Error correction in redundant residue number systems

AU - Yau, Sik-Sang

AU - Liu, Y. C.

PY - 1972/1/1

Y1 - 1972/1/1

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

ER -