An efficient residue-to-binary converter for the moduli set {2n−1−1, 2n+k, 2n−1}

M. M. Latha, R. Rachh, P. Mohan
{"title":"An efficient residue-to-binary converter for the moduli set {2n−1−1, 2n+k, 2n−1}","authors":"M. M. Latha, R. Rachh, P. Mohan","doi":"10.1109/PRIMEASIA.2017.8280351","DOIUrl":null,"url":null,"abstract":"In this paper, a RNS (Residue Number System) to Binary converter for the three-moduli set {2<sup>n−1</sup>−1, 2<sup>n+k</sup>, 2<sup>n</sup>−1} using two-stage Mixed Radix Conversion (MRC) is presented. Two separate cases (a) 0 ≤ k ≤ n-2, and (b) k = n−1, k = n lead to two different reverse converters. The proposed reverse converters are evaluated and compared with state of the art reverse converters proposed for this moduli set regarding hardware requirement and conversion time.","PeriodicalId":335218,"journal":{"name":"2017 IEEE Asia Pacific Conference on Postgraduate Research in Microelectronics and Electronics (PrimeAsia)","volume":"56 77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Asia Pacific Conference on Postgraduate Research in Microelectronics and Electronics (PrimeAsia)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRIMEASIA.2017.8280351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, a RNS (Residue Number System) to Binary converter for the three-moduli set {2n−1−1, 2n+k, 2n−1} using two-stage Mixed Radix Conversion (MRC) is presented. Two separate cases (a) 0 ≤ k ≤ n-2, and (b) k = n−1, k = n lead to two different reverse converters. The proposed reverse converters are evaluated and compared with state of the art reverse converters proposed for this moduli set regarding hardware requirement and conversion time.
模集{2n−1−1,2n +k, 2n−1}的有效残二变换器
本文利用两级混合基数转换(MRC),给出了三模集{2n−1−1,2n +k, 2n−1}的RNS(残数系统)到二进制的转换。(a) 0≤k≤n-2, (b) k = n−1,k = 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学术官方微信