{"title":"模集{22n−1,22n +1−1,2n}的残差加权带符号数转换","authors":"Changjun Jiang, Shugang Wei","doi":"10.1109/NEWCAS.2012.6328943","DOIUrl":null,"url":null,"abstract":"By introducing a signed-digit (SD) number arithmetic into a residue number system (RNS), arithmetic operations can be performed efficiently. In this paper, a new residue-to-binary conversion algorithm for three-moduli set {22n - 1, 22n+1 - 1, 2n} using the SD number residue addition is proposed. Based on the proposed algorithm, the converter can be designed with only four high-speed SD adders. The comparison of the proposed converter using SD number arithmetic with the converter using binary arithmetic yields more efficient both in terms of area and time.","PeriodicalId":122918,"journal":{"name":"10th IEEE International NEWCAS Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Residue-weighted number conversion for moduli set {22n − 1, 22n+1 − 1, 2n} using signed-digit number\",\"authors\":\"Changjun Jiang, Shugang Wei\",\"doi\":\"10.1109/NEWCAS.2012.6328943\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"By introducing a signed-digit (SD) number arithmetic into a residue number system (RNS), arithmetic operations can be performed efficiently. In this paper, a new residue-to-binary conversion algorithm for three-moduli set {22n - 1, 22n+1 - 1, 2n} using the SD number residue addition is proposed. Based on the proposed algorithm, the converter can be designed with only four high-speed SD adders. The comparison of the proposed converter using SD number arithmetic with the converter using binary arithmetic yields more efficient both in terms of area and time.\",\"PeriodicalId\":122918,\"journal\":{\"name\":\"10th IEEE International NEWCAS Conference\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"10th IEEE International NEWCAS Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NEWCAS.2012.6328943\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE International NEWCAS Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NEWCAS.2012.6328943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Residue-weighted number conversion for moduli set {22n − 1, 22n+1 − 1, 2n} using signed-digit number
By introducing a signed-digit (SD) number arithmetic into a residue number system (RNS), arithmetic operations can be performed efficiently. In this paper, a new residue-to-binary conversion algorithm for three-moduli set {22n - 1, 22n+1 - 1, 2n} using the SD number residue addition is proposed. Based on the proposed algorithm, the converter can be designed with only four high-speed SD adders. The comparison of the proposed converter using SD number arithmetic with the converter using binary arithmetic yields more efficient both in terms of area and time.