{"title":"余数系统中不完全规定数的定义及其应用","authors":"D. Gamberger","doi":"10.1109/ARITH.1989.72828","DOIUrl":null,"url":null,"abstract":"Incompletely specified numbers in the residue number system (RNS) are defined in order to make multiplicative inverse computation of a number regardless of its magnitude possible. Incompletely specified RNS is the general RNS model in which completely specified numbers are the special case. Two efficient algorithms for transformation of incompletely to completely specified RNS numbers are shown. Examples of their application in divisibility testing and integer matrix inversion are described.<<ETX>>","PeriodicalId":305909,"journal":{"name":"Proceedings of 9th Symposium on Computer Arithmetic","volume":"133 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Incompletely specified numbers in the residue number system-definition and applications\",\"authors\":\"D. Gamberger\",\"doi\":\"10.1109/ARITH.1989.72828\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Incompletely specified numbers in the residue number system (RNS) are defined in order to make multiplicative inverse computation of a number regardless of its magnitude possible. Incompletely specified RNS is the general RNS model in which completely specified numbers are the special case. Two efficient algorithms for transformation of incompletely to completely specified RNS numbers are shown. Examples of their application in divisibility testing and integer matrix inversion are described.<<ETX>>\",\"PeriodicalId\":305909,\"journal\":{\"name\":\"Proceedings of 9th Symposium on Computer Arithmetic\",\"volume\":\"133 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 9th Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1989.72828\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 9th Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1989.72828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Incompletely specified numbers in the residue number system-definition and applications
Incompletely specified numbers in the residue number system (RNS) are defined in order to make multiplicative inverse computation of a number regardless of its magnitude possible. Incompletely specified RNS is the general RNS model in which completely specified numbers are the special case. Two efficient algorithms for transformation of incompletely to completely specified RNS numbers are shown. Examples of their application in divisibility testing and integer matrix inversion are described.<>