Residue-to-decimal converters for moduli sets with common factors

K. Gbolagade, S. Cotofana
{"title":"Residue-to-decimal converters for moduli sets with common factors","authors":"K. Gbolagade, S. Cotofana","doi":"10.1109/MWSCAS.2009.5236017","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate Residue Number System (RNS) to decimal conversion for moduli sets with common factors. First, we propose a new RNS to decimal converter for the moduli set {2n+2; 2n+1; 2n} for any integer n > 0, which is a generalization of a recently proposed reverse converter for this moduli set. Second, we provide a general 4-moduli RNS conversion scheme and then present a compact form of multiplicative inverses, valid for odd-n, for the moduli set {2n+3; 2n+2; 2n+1; 2n}. This extended moduli set increases the dynamic range and the processing parallelism enabling efficient conversion.","PeriodicalId":254577,"journal":{"name":"2009 52nd IEEE International Midwest Symposium on Circuits and Systems","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 52nd IEEE International Midwest Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.2009.5236017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper, we investigate Residue Number System (RNS) to decimal conversion for moduli sets with common factors. First, we propose a new RNS to decimal converter for the moduli set {2n+2; 2n+1; 2n} for any integer n > 0, which is a generalization of a recently proposed reverse converter for this moduli set. Second, we provide a general 4-moduli RNS conversion scheme and then present a compact form of multiplicative inverses, valid for odd-n, for the moduli set {2n+3; 2n+2; 2n+1; 2n}. This extended moduli set increases the dynamic range and the processing parallelism enabling efficient conversion.
公因式模集的残数-十进制转换器
本文研究了具有公因式模集的剩余数制到十进制的转换。首先,我们针对模集{2n+2]提出了一种新的RNS - decimal转换器;2 n + 1;对于任意整数n > 0的2n},这是最近提出的对该模集的反向转换器的推广。其次,我们提供了一个一般的4模RNS转换方案,然后给出了对奇数n有效的乘逆的紧凑形式,对于模集{2n+3;2 n + 2;2 n + 1;2 n}。这种扩展模集增加了动态范围和处理并行性,从而实现了有效的转换。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信