{"title":"残数到二进制转换的表查找方案","authors":"C.C. Lamb, L. DeBrunner","doi":"10.1109/ACSSC.1995.540543","DOIUrl":null,"url":null,"abstract":"Residue number system (RNS) implementations can provide speedup for addition, subtraction, and multiplication. However, conversion from RNS to binary is a significant bottleneck. We present an efficient scheme to convert residue numbers to binary numbers using table-lookup. The overall goal is to minimize the hardware needed for implementation while maximizing the speed of the conversion. Our design decreases the table size by a factor of 2 and reduces the number of required lookups compared to an existing design.","PeriodicalId":171264,"journal":{"name":"Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A table-lookup scheme for residue-to-binary conversion\",\"authors\":\"C.C. Lamb, L. DeBrunner\",\"doi\":\"10.1109/ACSSC.1995.540543\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Residue number system (RNS) implementations can provide speedup for addition, subtraction, and multiplication. However, conversion from RNS to binary is a significant bottleneck. We present an efficient scheme to convert residue numbers to binary numbers using table-lookup. The overall goal is to minimize the hardware needed for implementation while maximizing the speed of the conversion. Our design decreases the table size by a factor of 2 and reduces the number of required lookups compared to an existing design.\",\"PeriodicalId\":171264,\"journal\":{\"name\":\"Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.1995.540543\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.1995.540543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A table-lookup scheme for residue-to-binary conversion
Residue number system (RNS) implementations can provide speedup for addition, subtraction, and multiplication. However, conversion from RNS to binary is a significant bottleneck. We present an efficient scheme to convert residue numbers to binary numbers using table-lookup. The overall goal is to minimize the hardware needed for implementation while maximizing the speed of the conversion. Our design decreases the table size by a factor of 2 and reduces the number of required lookups compared to an existing design.