Residue-weighted number conversion for moduli set {22n − 1, 22n+1 − 1, 2n} using signed-digit number

Changjun Jiang, Shugang Wei
{"title":"Residue-weighted number conversion for moduli set {22n − 1, 22n+1 − 1, 2n} using signed-digit number","authors":"Changjun Jiang, Shugang Wei","doi":"10.1109/NEWCAS.2012.6328943","DOIUrl":null,"url":null,"abstract":"By introducing a signed-digit (SD) number arithmetic into a residue number system (RNS), arithmetic operations can be performed efficiently. In this paper, a new residue-to-binary conversion algorithm for three-moduli set {22n - 1, 22n+1 - 1, 2n} using the SD number residue addition is proposed. Based on the proposed algorithm, the converter can be designed with only four high-speed SD adders. The comparison of the proposed converter using SD number arithmetic with the converter using binary arithmetic yields more efficient both in terms of area and time.","PeriodicalId":122918,"journal":{"name":"10th IEEE International NEWCAS Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE International NEWCAS Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NEWCAS.2012.6328943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

By introducing a signed-digit (SD) number arithmetic into a residue number system (RNS), arithmetic operations can be performed efficiently. In this paper, a new residue-to-binary conversion algorithm for three-moduli set {22n - 1, 22n+1 - 1, 2n} using the SD number residue addition is proposed. Based on the proposed algorithm, the converter can be designed with only four high-speed SD adders. The comparison of the proposed converter using SD number arithmetic with the converter using binary arithmetic yields more efficient both in terms of area and time.
模集{22n−1,22n +1−1,2n}的残差加权带符号数转换
通过在残数系统中引入符号数算法,可以有效地进行算术运算。针对三模集{22n - 1,22n +1 - 1,2n},提出了一种利用SD数残数相加的残数-二值转换算法。基于所提出的算法,转换器只需四个高速SD加法器。将采用SD数算法的转换器与采用二进制算法的转换器进行比较,在面积和时间上都更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信