{"title":"一种基于模(2/sup p/ - 1)符号数算法的RNS -混合基数转换器","authors":"Shugang Wei, K. Shimizu","doi":"10.1109/APCCAS.2004.1412774","DOIUrl":null,"url":null,"abstract":"In this paper, a hardware algorithm converting the numbers in a residue number system (RNS) to that in a mixed-radix number system by using signed-digit (SD) arithmetic is presented. In each residue digit of the RNS, integers mi = (2Pi - 1) are used as the moduli and the modulo m addition and multiplication can be performed by an end-around-carry SD adder and a binary modulo m SD adder tree, respectively. Thus a high speed converter can be designed by using the proposed modulo m SD adders and multipliers","PeriodicalId":426683,"journal":{"name":"The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new RNS to mixed-radix number converter using modulo (2/sup p/ - 1) signed-digit arithmetic\",\"authors\":\"Shugang Wei, K. Shimizu\",\"doi\":\"10.1109/APCCAS.2004.1412774\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a hardware algorithm converting the numbers in a residue number system (RNS) to that in a mixed-radix number system by using signed-digit (SD) arithmetic is presented. In each residue digit of the RNS, integers mi = (2Pi - 1) are used as the moduli and the modulo m addition and multiplication can be performed by an end-around-carry SD adder and a binary modulo m SD adder tree, respectively. Thus a high speed converter can be designed by using the proposed modulo m SD adders and multipliers\",\"PeriodicalId\":426683,\"journal\":{\"name\":\"The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings.\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCCAS.2004.1412774\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCCAS.2004.1412774","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new RNS to mixed-radix number converter using modulo (2/sup p/ - 1) signed-digit arithmetic
In this paper, a hardware algorithm converting the numbers in a residue number system (RNS) to that in a mixed-radix number system by using signed-digit (SD) arithmetic is presented. In each residue digit of the RNS, integers mi = (2Pi - 1) are used as the moduli and the modulo m addition and multiplication can be performed by an end-around-carry SD adder and a binary modulo m SD adder tree, respectively. Thus a high speed converter can be designed by using the proposed modulo m SD adders and multipliers