loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1996 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'96)
A New Euclidean Division Algorithm For Residue Number Systems
Chicago, IL
August 19-August 23
ISBN: 0-8186-7542-X
J.-C. Bajard, Univ. de Provence, Marseille, France
L.-S. Didier, Univ. de Provence, Marseille, France
J.-M. Muller, Univ. de Provence, Marseille, France
We propose in this paper a new algorithm and architecture for performing divisions in residue number systems. Our algorithm is suitable for residue number systems with large moduli, with the aim of manipulating very large integers on a parallel computer or a special-purpose architecture. The two basic features of our algorithm are on one hand the use of a high-radix division method, and on the other hand the use of a floating-point arithmetic that should run in parallel with the modular arithmetic.
Index Terms:
residue number systems; floating point arithmetic; digital arithmetic; computational geometry; Euclidean division algorithm; residue number systems; large moduli; very large integers; parallel computer; special-purpose architecture; high-radix division method; floating-point arithmetic; modular arithmetic
Citation:
J.-C. Bajard, L.-S. Didier, J.-M. Muller, "A New Euclidean Division Algorithm For Residue Number Systems," asap, pp.45, 1996 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'96), 1996
Usage of this product signifies your acceptance of the Terms of Use.