Paper
28 February 2005 Residue number system scaling schemes
Author Affiliations +
Proceedings Volume 5649, Smart Structures, Devices, and Systems II; (2005) https://doi.org/10.1117/12.582137
Event: Smart Materials, Nano-, and Micro-Smart Systems, 2004, Sydney, Australia
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, bse 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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yinan Kong and Braden Phillips "Residue number system scaling schemes", Proc. SPIE 5649, Smart Structures, Devices, and Systems II, (28 February 2005); https://doi.org/10.1117/12.582137
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications and 1 patent.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Radon

CRTs

Binary data

Computing systems

Error analysis

Digital filtering

Digital signal processing

RELATED CONTENT

Performance of the European logarithmic microprocessor
Proceedings of SPIE (December 24 2003)
RNS bases and conversions
Proceedings of SPIE (October 26 2004)
Tools for mapping applications to CCMs
Proceedings of SPIE (October 08 1998)
Parity-preserving transformations in computer arithmetic
Proceedings of SPIE (December 06 2002)
Design of binary filters by sequential basis expansion
Proceedings of SPIE (April 27 2001)

Back to Top