Development of optimum addition algorithm using modified parallel hybrid signed digit (MPHSD) technique

V. Awasthi, K. Raj
{"title":"Development of optimum addition algorithm using modified parallel hybrid signed digit (MPHSD) technique","authors":"V. Awasthi, K. Raj","doi":"10.1109/IADCC.2013.6514450","DOIUrl":null,"url":null,"abstract":"Signed digit (SD) number systems provide the possibility of constant-time addition, where interdigit carry propagation is eliminated. In this paper, two classes of parallel adder are surveyed with an asynchronous adder based on their delay, area and power characteristics. With the development of high speed processors, a tradeoff is always required between area and execution time to yield the most suitable implementation with low power consumption. In this paper, we proposed an optimum high speed fast adder algorithm by using signed and hybrid signed digit algorithms. This modified parallel hybrid signed digit (MPHSD) adder has high speed and less area as compare to conventional adders like ripple carry adder and carry lookahead adder. The MPHSD adder require few more configuration logic blocks (CLB's) because of redundant logic to optimize execution time with area and power. A relative merits and demerits is also evaluated by performing a detailed analysis in terms of its cost and performance.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 3rd IEEE International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2013.6514450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Signed digit (SD) number systems provide the possibility of constant-time addition, where interdigit carry propagation is eliminated. In this paper, two classes of parallel adder are surveyed with an asynchronous adder based on their delay, area and power characteristics. With the development of high speed processors, a tradeoff is always required between area and execution time to yield the most suitable implementation with low power consumption. In this paper, we proposed an optimum high speed fast adder algorithm by using signed and hybrid signed digit algorithms. This modified parallel hybrid signed digit (MPHSD) adder has high speed and less area as compare to conventional adders like ripple carry adder and carry lookahead adder. The MPHSD adder require few more configuration logic blocks (CLB's) because of redundant logic to optimize execution time with area and power. A relative merits and demerits is also evaluated by performing a detailed analysis in terms of its cost and performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于改进并行混合符号数(MPHSD)技术的最优加法算法的开发
有符号数字(SD)数字系统提供了恒定时间加法的可能性,消除了数字间进位传播。本文用异步加法器对两类并行加法器的时延、面积和功率特性进行了研究。随着高速处理器的发展,总是需要在面积和执行时间之间进行权衡,以产生具有低功耗的最合适的实现。本文提出了一种采用有符号和混合有符号数算法的最优高速快速加法器算法。与传统的纹波进位加法器和进位前移加法器相比,这种改进的并行混合符号数加法器具有速度快、面积小的优点。由于冗余逻辑,MPHSD加法器需要更多的配置逻辑块(CLB)来优化执行时间、面积和功率。通过对其成本和性能进行详细分析,还可以评估其相对优点和缺点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A competent design of 2∶1 multiplexer and its application in 1-bit full adder cell Learning algorithms For intelligent agents based e-learning system Preamble-based timing synchronization for OFDM systems An efficient Self-organizing map learning algorithm with winning frequency of neurons for clustering application Comparison of present-day networking and routing protocols on underwater wireless communication
×
引用
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