Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ARITH
2003
IEEE

favoriteEmaildiscussreport

85views Applied Computing» more ARITH 2003»

Scaling an RNS Number Using the Core Function

13 years 9 months ago

Scaling an RNS Number Using the Core Function

Download www.dec.usc.es

This paper introduces a method for extracting the core of a Residue Number System (RNS) number within the RNS, this affording a new method for scaling RNS numbers. Suppose an RNS comprises a set of co-prime moduli, mi, with ∏mi = M. This paper describes a method for approximately scaling such an RNS number by a subset of the moduli, ∏mj = MJ ≈ √M, with the characteristic that all computations are performed using the original moduli and one other non-maintained short wordlength modulus.

Neil Burgess

Real-time Traffic

Applied Computing | ARITH 2003 | Co-prime Moduli | Residue Number System | Rns Number |

claim paper

Related Content

» The Residue Logarithmic Number System Theory and Implementation

» LargeScale Maximum Margin Discriminant Analysis Using Core Vector Machines

» Scaling the bandwidth wall challenges in and avenues for CMP scaling

» Physical vs Virtual Express Topologies with LowSwing Links for Future ManyCore NoCs

» An efficient voltage scaling algorithm for complex SoCs with few number of voltage modes

» Simulating dynamic communication systems using the core functional dataflow model

» OutofCore Bundle Adjustment for LargeScale 3D Reconstruction

» BGRanks and 2Cores

» Optimizing Multicast Performance in LargeScale WLANs

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	ARITH
Authors	Neil Burgess

Comments (0)