高基数符号加法器的改进设计

F. Naderpour, S. Ko
{"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}
引用次数: 1

摘要

高速加法器在计算机算法中是非常重要的,因此加法器性能的微小改进对其他运算有很大的影响。一种提高加法器速度的方法是通过使用无进位加法器来消除进位传播。本文改进了先前最快的无进位加法器,将传输数集改为[-2,1]。结果表明,这个小的变化导致了一个更简单的符号数字加法器,它比以前最快的工作消耗更低的面积/功率,同时不会增加延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improved Design of High-Radix Signed-Digit Adders
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-objective Low-Power CDFG Scheduling Using Fine-Grained DVS Architecture in Distributed Framework Improvement in Target Detectability Using Spread Spectrum Radar in Dispersive Channel Condition Systolic Variable Length Architecture for Discrete Fourier Transform in Long Term Evolution High Speed Generic Network Interface for Network on Chip Using Ping Pong Buffers Synthesis of Toffoli Networks: Status and Challenges
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1