loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th IEEE Symposium on Computer Arithmetic (ARITH-16 '03)
Scaling an RNS Number Using the Core Function
Santiago de Compostela, Spain
June 15-June 18
ISBN: 0-7695-1894-X
ASCII Text
x 
 
Neil Burgess, "Scaling an RNS Number Using the Core Function," Computer Arithmetic, IEEE Symposium on, pp. 262, 16th IEEE Symposium on Computer Arithmetic (ARITH-16 '03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/ARITH.2003.1207687,
author = {Neil Burgess},
title = {Scaling an RNS Number Using the Core Function},
journal ={Computer Arithmetic, IEEE Symposium on},
volume = {0},
year = {2003},
issn = {1063-6889},
pages = {262},
doi = {http://doi.ieeecomputersociety.org/10.1109/ARITH.2003.1207687},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Arithmetic, IEEE Symposium on
TI - Scaling an RNS Number Using the Core Function
SN - 1063-6889
SP
EP
A1 - Neil Burgess,
PY - 2003
KW - null
VL - 0
JA - Computer Arithmetic, IEEE Symposium on
ER -
 
Neil Burgess, Cardiff University
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 \prod {m_i } = M. This paper describes a method for approximately scaling such an RNS number by a subset of the moduli, \prod {m_j } = M_j \approx \sqrt M, with the characteristic that all computations are performed using the original moduli and one other non-maintained short wordlength modulus.
Citation:
Neil Burgess, "Scaling an RNS Number Using the Core Function," arith, pp.262, 16th IEEE Symposium on Computer Arithmetic (ARITH-16 '03), 2003
Usage of this product signifies your acceptance of the Terms of Use.