Residue-Weighted Number Conversion with Moduli Set {2^p-1, 2^p+1, 2^{2p}+1, 2^p} Using Signed-Digit Number Arithmetic

2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science Pub Date : 2010-08-10 DOI:10.1109/DCABES.2010.132

Changjun Jiang, Shugang Wei

引用次数: 2

Abstract

By introducing a signed-digit (SD) number arithmetic into a residue number system (RNS), arithmetic operations can be performed efficiently. In this study, an algorithm for residue-to-binary with four moduli set {2^p− 1, 2^p +1, 2^{2p}+1, 2^p} using the SD number high-speed residue addition is proposed. Based on the proposed algorithm, the converters are designed with 2-level binary tree structure of SD number residue additions. The comparison of the new converter using SD number arithmetic and the converter using binary arithmetic yields reductions in delays of 22% and 40% for p=4 and p=8, respectively.

查看原文本刊更多论文

基于符号数字算法的模集{2^p- 1,2 ^p+ 1,2 ^{2p}+ 1,2 ^p}残差加权数转换

通过在残数系统中引入符号数算法，可以有效地进行算术运算。本文提出了一种基于SD数高速残数加法的四模集{2^p−1,2 ^p + 1,2 ^{2p}+ 1,2 ^p}残数到二值化算法。在此基础上，设计了SD数残数相加的2级二叉树结构。在p=4和p=8时，使用SD数算法的新转换器和使用二进制算法的转换器的比较分别减少了22%和40%的延迟。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science

自引率

0.00%

发文量