Residue arithmetic circuits using a signed-digit number representation

被引:0
|
作者
Wei, SG [1 ]
Shimizu, K [1 ]
机构
[1] Gunma Univ, Dept Comp Sci, Gunma, Japan
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A new concept on residue arithmetic using a radix-2 signed-digit(SD) number representation is presented, by which memoryless residue arithmetic circuits using SD adders can be implemented. For a given modulus m, 2(P) - 1 less than or equal to m less than or equal to 2(P) + 2(P-1) - 1, in a residue number system(RNS), the module m addition is performed by using two p-digit SD adders. Thus, the module m addition time is independent of the word length of operands. When m = 2(P) or m = 2(P) +/- 1, especially, the modulo m addition is implemented by only using one SD adder. Moreover, a module m multiplier can be constructed using a binary module m SD adder tree, so that the module m multiplication can be performed in a time proportional to log(2)p.
引用
收藏
页码:24 / 27
页数:4
相关论文
共 50 条