Residue number system scaling schemes

Yinan Kong; Braden Phillips

doi:10.1117/12.582137

Residue number system scaling schemes

Yinan Kong^*, Braden Phillips

^*Corresponding author for this work

Research output: Contribution to journal › Article

4 Citations (Scopus)

3 Downloads (Pure)

Abstract

Although multiplication and addition can be very efficiently implemented in a Residue Number System (RNS), scaling (division by a constant) is much more computationally complex. This limitation has prevented wider adoption of RNS. In this paper, different RNS scaling schemes are surveyed and compared. It is found that scaling in RNS has been performed with the aid of conversions to and from RNS, base extensions between modulus sets, and redundant RNS channels. Recent advances in RNS scaling theory have reduced the overhead of such measures but RNS scaling still falls short of the ideal: a simple operation performed entirely within the RNS channels.

Original language	English
Article number	82
Pages (from-to)	525-536
Number of pages	12
Journal	Proceedings of SPIE - The International Society for Optical Engineering
Volume	5649
Issue number	PART 2
DOIs	https://doi.org/10.1117/12.582137
Publication status	Published - 2005
Externally published	Yes

Bibliographical note

Copyright 2005 Society of Photo Optical Instrumentation Engineers. One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.

Access to Document

10.1117/12.582137

Publisher version (open access).pdfFinal published version, 305 KB

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Residue number system scaling schemes'. Together they form a unique fingerprint.

Cite this

@article{cfb0c27ccdbf404889d6f8fdf3ce53dd,

title = "Residue number system scaling schemes",

abstract = "Although multiplication and addition can be very efficiently implemented in a Residue Number System (RNS), scaling (division by a constant) is much more computationally complex. This limitation has prevented wider adoption of RNS. In this paper, different RNS scaling schemes are surveyed and compared. It is found that scaling in RNS has been performed with the aid of conversions to and from RNS, base extensions between modulus sets, and redundant RNS channels. Recent advances in RNS scaling theory have reduced the overhead of such measures but RNS scaling still falls short of the ideal: a simple operation performed entirely within the RNS channels.",

author = "Yinan Kong and Braden Phillips",

note = "Copyright 2005 Society of Photo Optical Instrumentation Engineers. One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.",

year = "2005",

doi = "10.1117/12.582137",

language = "English",

volume = "5649",

pages = "525--536",

journal = "Proceedings of SPIE - The International Society for Optical Engineering",

issn = "0277-786X",

publisher = "SPIE",

number = "PART 2",

}

TY - JOUR

T1 - Residue number system scaling schemes

AU - Kong, Yinan

AU - Phillips, Braden

N1 - Copyright 2005 Society of Photo Optical Instrumentation Engineers. One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.

PY - 2005

Y1 - 2005

N2 - Although multiplication and addition can be very efficiently implemented in a Residue Number System (RNS), scaling (division by a constant) is much more computationally complex. This limitation has prevented wider adoption of RNS. In this paper, different RNS scaling schemes are surveyed and compared. It is found that scaling in RNS has been performed with the aid of conversions to and from RNS, base extensions between modulus sets, and redundant RNS channels. Recent advances in RNS scaling theory have reduced the overhead of such measures but RNS scaling still falls short of the ideal: a simple operation performed entirely within the RNS channels.

AB - Although multiplication and addition can be very efficiently implemented in a Residue Number System (RNS), scaling (division by a constant) is much more computationally complex. This limitation has prevented wider adoption of RNS. In this paper, different RNS scaling schemes are surveyed and compared. It is found that scaling in RNS has been performed with the aid of conversions to and from RNS, base extensions between modulus sets, and redundant RNS channels. Recent advances in RNS scaling theory have reduced the overhead of such measures but RNS scaling still falls short of the ideal: a simple operation performed entirely within the RNS channels.

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

U2 - 10.1117/12.582137

DO - 10.1117/12.582137

M3 - Article

VL - 5649

SP - 525

EP - 536

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

IS - PART 2

M1 - 82

ER -