A Novel Area-Delay Efficient Carry Select Adder Based on New Add-one Circuit

Maytham Allahi Roodposhti, M. Valinataj
{"title":"A Novel Area-Delay Efficient Carry Select Adder Based on New Add-one Circuit","authors":"Maytham Allahi Roodposhti, M. Valinataj","doi":"10.1109/ICCKE48569.2019.8964968","DOIUrl":null,"url":null,"abstract":"In this paper, a new carry select adder (CSLA) architecture is proposed with a lower area and a higher speed compared to previous CSLAs. The proposed CSLA is a low-area and high-speed design utilizing a new add-one circuit that is used instead of the second ripple carry adder (RCA) with the input carry equal to one (Cin=1) inside each group of the basic CSLA. Moreover, to expedite the add operation, a new grouping structure is proposed instead of the basic square-root (SQRT) grouping as well as utilizing a faster RCA in each group. Despite the fact that the proposed CSLA has not attained the lowest power consumption among all existing designs based on the PDK 45nm standard cell library, but it has achieved the lowest area and delay compared to previous CSLAs. Implementation results show that 8 to 33% area reduction and 12 to 44% speed improvement are achieved in the proposed CSLA compared to previous designs.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"94 1","pages":"225-230"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE48569.2019.8964968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, a new carry select adder (CSLA) architecture is proposed with a lower area and a higher speed compared to previous CSLAs. The proposed CSLA is a low-area and high-speed design utilizing a new add-one circuit that is used instead of the second ripple carry adder (RCA) with the input carry equal to one (Cin=1) inside each group of the basic CSLA. Moreover, to expedite the add operation, a new grouping structure is proposed instead of the basic square-root (SQRT) grouping as well as utilizing a faster RCA in each group. Despite the fact that the proposed CSLA has not attained the lowest power consumption among all existing designs based on the PDK 45nm standard cell library, but it has achieved the lowest area and delay compared to previous CSLAs. Implementation results show that 8 to 33% area reduction and 12 to 44% speed improvement are achieved in the proposed CSLA compared to previous designs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于新型加一电路的区域延迟高效进位选择加法器
本文提出了一种新的进位选择加法器(CSLA)结构,与以前的CSLA相比,它具有更小的面积和更高的速度。所提出的CSLA是一种低面积和高速设计,利用新的加一电路来代替第二个纹波进位加法器(RCA),在每组基本CSLA中输入进位等于1 (Cin=1)。此外,为了提高加法运算的速度,提出了一种新的分组结构来代替基本的平方根(SQRT)分组,并在每组中使用更快的RCA。尽管在所有基于PDK 45nm标准单元库的现有设计中,所提出的CSLA并没有达到最低的功耗,但与以前的CSLA相比,它已经实现了最低的面积和延迟。实施结果表明,与以前的设计相比,所提出的CSLA的面积减少了8 ~ 33%,速度提高了12 ~ 44%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Parallel Jobs Scheduling Algorithm in The Cloud Computing Online QoS Multicast Routing in Multi-Channel Multi-Radio Wireless Mesh Networks using Network Coding Tasks Decomposition for Improvement of Genetic Network Programming Robust Real-time Magnetic-based Object Localization to Sensor’s Fault using Recurrent Neural Networks A Case Study for Presenting Bank Recommender Systems based on Bon Card Transaction Data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1