{"title":"高基数符号加法器的改进设计","authors":"F. Naderpour, S. Ko","doi":"10.1109/ISED.2012.10","DOIUrl":null,"url":null,"abstract":"High speed adders are very important in computer arithmetic such that a small improvement in the performance of adders has a great impact on other operations. A way to speed up the adders is to eliminate carry propagation by using carry-free adders. In this paper we improve the fastest previous carry-free adder by changing the transfer digit-set to [-2,1]. It is shown that this small change leads to a simpler signed-digit adder which consumes lower area/power than the fastest previous work while not increasing the latency.","PeriodicalId":276803,"journal":{"name":"2012 International Symposium on Electronic System Design (ISED)","volume":"90 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improved Design of High-Radix Signed-Digit Adders\",\"authors\":\"F. Naderpour, S. Ko\",\"doi\":\"10.1109/ISED.2012.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"High speed adders are very important in computer arithmetic such that a small improvement in the performance of adders has a great impact on other operations. A way to speed up the adders is to eliminate carry propagation by using carry-free adders. In this paper we improve the fastest previous carry-free adder by changing the transfer digit-set to [-2,1]. It is shown that this small change leads to a simpler signed-digit adder which consumes lower area/power than the fastest previous work while not increasing the latency.\",\"PeriodicalId\":276803,\"journal\":{\"name\":\"2012 International Symposium on Electronic System Design (ISED)\",\"volume\":\"90 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Symposium on Electronic System Design (ISED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISED.2012.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Symposium on Electronic System Design (ISED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISED.2012.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
High speed adders are very important in computer arithmetic such that a small improvement in the performance of adders has a great impact on other operations. A way to speed up the adders is to eliminate carry propagation by using carry-free adders. In this paper we improve the fastest previous carry-free adder by changing the transfer digit-set to [-2,1]. It is shown that this small change leads to a simpler signed-digit adder which consumes lower area/power than the fastest previous work while not increasing the latency.