A new euclidean division algorithm for residue number systems

被引:9
|
作者
Bajard, JC
Didier, LS
Muller, JM
机构
[1] Univ Provence, CML, Lab Informat Marseille, F-13453 Marseille, France
[2] CNRS, Lab Informat Parallelisme, F-69364 Lyon 07, France
关键词
IEEE Computer Society; Digit Number; Modular Multiplication; Computer Arithmetic; Chinese Remainder Theorem;
D O I
10.1023/A:1008065819322
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:167 / 178
页数:12
相关论文
共 50 条