Fast division in residue arithmetic

Z. Ulman, M. Czyzak, J. Zurada
{"title":"Fast division in residue arithmetic","authors":"Z. Ulman, M. Czyzak, J. Zurada","doi":"10.1109/PACRIM.1991.160835","DOIUrl":null,"url":null,"abstract":"A residue division technique is presented. The technique is based on the use of a number system termed the radix-based residue number system (RNS) and, associated with it, the homogeneous mixed-radix number system (HMRS). The quotient is obtained as the sum of the rounded partial quotients of the HMRS weights and the divisor. The division is fast, noniterative, and implementable in a parallel look-up table based architecture. Contrary to binary division by right shifting, the division time is fixed and independent of the divisor value.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1991.160835","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A residue division technique is presented. The technique is based on the use of a number system termed the radix-based residue number system (RNS) and, associated with it, the homogeneous mixed-radix number system (HMRS). The quotient is obtained as the sum of the rounded partial quotients of the HMRS weights and the divisor. The division is fast, noniterative, and implementable in a parallel look-up table based architecture. Contrary to binary division by right shifting, the division time is fixed and independent of the divisor value.<>
残数算法中的快速除法
提出了一种残数分割技术。该技术基于一种称为基于基数的剩余数系统(RNS)的数字系统的使用,以及与之相关的齐次混合基数系统(HMRS)。商为各HMRS权重的四舍五入偏商与除数之和。除法快速,非迭代,并且可以在基于并行查找表的体系结构中实现。与右移二进制除法不同,除法时间是固定的,与除数值无关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信