{"title":"RNS算法体系结构的矩阵混合基数转换","authors":"N. Yassine","doi":"10.1109/MWSCAS.1991.252046","DOIUrl":null,"url":null,"abstract":"The author describes an improved technique for transforming a residue number into a mixed-radix weighted representation using matrix techniques. The mixed-radix digits of the proposed conversion procedure are factorized into a product of two terms each. One term is invariant and predetermined, while the other is variable and depends on the particular residue number being converted. In comparison with previous conversion techniques, the proposed conversion method achieves a considerable reduction in the number of arithmetic multiplications needed during the conversion process.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"206 1","pages":"273-278 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Matrix mixed-radix conversion for RNS arithmetic architectures\",\"authors\":\"N. Yassine\",\"doi\":\"10.1109/MWSCAS.1991.252046\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author describes an improved technique for transforming a residue number into a mixed-radix weighted representation using matrix techniques. The mixed-radix digits of the proposed conversion procedure are factorized into a product of two terms each. One term is invariant and predetermined, while the other is variable and depends on the particular residue number being converted. In comparison with previous conversion techniques, the proposed conversion method achieves a considerable reduction in the number of arithmetic multiplications needed during the conversion process.<<ETX>>\",\"PeriodicalId\":6453,\"journal\":{\"name\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"volume\":\"206 1\",\"pages\":\"273-278 vol.1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.1991.252046\",\"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 of the 34th Midwest Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1991.252046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Matrix mixed-radix conversion for RNS arithmetic architectures
The author describes an improved technique for transforming a residue number into a mixed-radix weighted representation using matrix techniques. The mixed-radix digits of the proposed conversion procedure are factorized into a product of two terms each. One term is invariant and predetermined, while the other is variable and depends on the particular residue number being converted. In comparison with previous conversion techniques, the proposed conversion method achieves a considerable reduction in the number of arithmetic multiplications needed during the conversion process.<>