Adder based residue to binary number converters for (2n-1, 2n, 2n+1)
Adder based residue to binary number converters for (2n-1, 2n, 2n+1)
复制标题
基于加法器的余数到二进制数转换器 (2n-1, 2n, 2n 1)
DOI：
10.1109/tsp.2002.1011216
复制
发表时间：
2002
影响因子：
5.4
通讯作者：
Hong Shen
中科院分区：
文献类型：
--
作者：
Yuke Wang;Xiaoyu Song;E. Aboulhamid;Hong Shen
基于从中国新剩余定理I导出的一种算法，我们提出了三种新的剩余数系统（2/sup n/- 1,2 /sup n/, 2/sup n/+1）的剩余-二进制转换器，它们使用2n位或n位加法器，与以前的各种转换器相比，在速度、面积和动态范围上都有改进。基于2n位加法器的转换器速度更快，所需的硬件大约是以前方法的一半。对于基于n位加法器的实现，使用相同数量的硬件，一种新的转换器比以前的方法快两倍，而另一种新的转换器与以前的转换器相比，在速度、面积或动态范围方面都有所改进。
Based on an algorithm derived from the new Chinese remainder theorem I, we present three new residue-to-binary converters for the residue number system (2/sup n/-1, 2/sup n/, 2/sup n/+1) designed using 2n-bit or n-bit adders with improvements on speed, area, or dynamic range compared with various previous converters. The 2n-bit adder based converter is faster and requires about half the hardware required by previous methods. For n-bit adder-based implementations, one new converter is twice as fast as the previous method using a similar amount of hardware, whereas another new converter achieves improvement in either speed, area, or dynamic range compared with previous converters.