Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
A New Euclidean Division Algorithm for Residue Number Systems
| |
|
A New Euclidean Division Algorithm for Residue Number Systems Jean-Claude Bajard1, Laurent-Stéphane Didier1 and Jean-Michel Muller2 | (1) | Laboratoire d'Informatique de Marseille, CML, Université de Provence, 39 rue Joliot-Curie, 13453 Marseille Cedex, France |
| (2) | CNRS, Laboratoire de l'Informatique du Parallélisme, 46 Allée d'Italie, 69364 Lyon Cedex 07, France |
Abstract We propose a new algorithm and architecture for performing divisions in residue number systems (RNS). Our algorithm is suitable for RNS 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 the use of a high-radix division method, and the use of a floating-point arithmetic that should run in parallel with the modular arithmetic.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|