余数系统中整数除法的新方法

[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic Pub Date : 1991-06-26 DOI:10.1109/ARITH.1991.145538

D. Gamberger

{"title":"余数系统中整数除法的新方法","authors":"D. Gamberger","doi":"10.1109/ARITH.1991.145538","DOIUrl":null,"url":null,"abstract":"A novel division algorithm that is especially appropriate for residue number systems (RNSs) is presented. It makes use of the fact that the multiplicative inverse element of a divisor which is relatively prime to system moduli can be easily determined in the RNS. The number of its iterations depends only on the magnitude of the divisor and the moduli of the system. The problems in the algorithm realization are analyzed in detail, and a complete solution using the incompletely specified RNS is described.<<ETX>>","PeriodicalId":190650,"journal":{"name":"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"New approach to integer division in residue number systems\",\"authors\":\"D. Gamberger\",\"doi\":\"10.1109/ARITH.1991.145538\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel division algorithm that is especially appropriate for residue number systems (RNSs) is presented. It makes use of the fact that the multiplicative inverse element of a divisor which is relatively prime to system moduli can be easily determined in the RNS. The number of its iterations depends only on the magnitude of the divisor and the moduli of the system. The problems in the algorithm realization are analyzed in detail, and a complete solution using the incompletely specified RNS is described.<<ETX>>\",\"PeriodicalId\":190650,\"journal\":{\"name\":\"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1991.145538\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1991.145538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

摘要

提出了一种特别适用于残数系统的除法算法。它利用了一个相对于系统模素数的除数的乘法逆元在RNS中可以很容易地确定的事实。它的迭代次数只取决于除数的大小和系统的模。详细分析了算法实现中存在的问题，并给出了一种使用不完全指定RNS的完整解决方案。

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

查看原文本刊更多论文

New approach to integer division in residue number systems

A novel division algorithm that is especially appropriate for residue number systems (RNSs) is presented. It makes use of the fact that the multiplicative inverse element of a divisor which is relatively prime to system moduli can be easily determined in the RNS. The number of its iterations depends only on the magnitude of the divisor and the moduli of the system. The problems in the algorithm realization are analyzed in detail, and a complete solution using the incompletely specified RNS is described.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic

自引率

0.00%

发文量