区域高效混合并行前缀加法器

N. Poornima , V. S. Kanchana Bhaaskaran
{"title":"区域高效混合并行前缀加法器","authors":"N. Poornima ,&nbsp;V. S. Kanchana Bhaaskaran","doi":"10.1016/j.mspro.2015.06.069","DOIUrl":null,"url":null,"abstract":"<div><p>Addition is a timing critical operation in almost all modern processing units. The performance parameters such as the implementation area, the adder latency and the power dissipation decide the choice of adders for different applications. Hence, there is an extensive research attention towards designing higher speed and less complex adder architectures with lower power dissipation. Among the several adder topologies available, parallel-prefix adders are the most frequently employed as they offer many design choices for achieving area/power/delay efficiency and they also provide optimization of the trade-offs. This paper discusses the design and implementation of area-power optimized hybrid parallel-prefix Ling adder. The hybrid adder topology employed in this work uses Ladner-Fischer approach for even-indexed and Kogge-Stone structure for odd-indexed bits. The independent computation of carries for odd and even bits, directly leads to the reduction of fan-out of the prefix tree and thereby a reduced delay. The area efficiency is achieved by the computation of the real carries using modified Ling's equations. The proposed adders are implemented with word size of 16 bit and 32 bit based on modified Ling equations using 0.18<!--> <!-->μm CMOS technology. The synthesis results reveal that the proposed adders could achieve up to 24% and 35% saving of area-power product and power-delay product respectively, over the adders based on conventional Ling equations.</p></div>","PeriodicalId":101041,"journal":{"name":"Procedia Materials Science","volume":"10 ","pages":"Pages 371-380"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.mspro.2015.06.069","citationCount":"16","resultStr":"{\"title\":\"Area Efficient Hybrid Parallel Prefix Adders\",\"authors\":\"N. Poornima ,&nbsp;V. S. Kanchana Bhaaskaran\",\"doi\":\"10.1016/j.mspro.2015.06.069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Addition is a timing critical operation in almost all modern processing units. The performance parameters such as the implementation area, the adder latency and the power dissipation decide the choice of adders for different applications. Hence, there is an extensive research attention towards designing higher speed and less complex adder architectures with lower power dissipation. Among the several adder topologies available, parallel-prefix adders are the most frequently employed as they offer many design choices for achieving area/power/delay efficiency and they also provide optimization of the trade-offs. This paper discusses the design and implementation of area-power optimized hybrid parallel-prefix Ling adder. The hybrid adder topology employed in this work uses Ladner-Fischer approach for even-indexed and Kogge-Stone structure for odd-indexed bits. The independent computation of carries for odd and even bits, directly leads to the reduction of fan-out of the prefix tree and thereby a reduced delay. The area efficiency is achieved by the computation of the real carries using modified Ling's equations. The proposed adders are implemented with word size of 16 bit and 32 bit based on modified Ling equations using 0.18<!--> <!-->μm CMOS technology. The synthesis results reveal that the proposed adders could achieve up to 24% and 35% saving of area-power product and power-delay product respectively, over the adders based on conventional Ling equations.</p></div>\",\"PeriodicalId\":101041,\"journal\":{\"name\":\"Procedia Materials Science\",\"volume\":\"10 \",\"pages\":\"Pages 371-380\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.mspro.2015.06.069\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Procedia Materials Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2211812815003077\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Procedia Materials Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2211812815003077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

加法运算在几乎所有现代处理单元中都是时间关键操作。实现区域、加法器延迟和功耗等性能参数决定了不同应用场合加法器的选择。因此,对于设计速度更快、复杂度更低、功耗更低的加法器结构有着广泛的研究关注。在几种可用的加法器拓扑中,并行前缀加法器是最常用的,因为它们为实现面积/功率/延迟效率提供了许多设计选择,并且还提供了权衡的优化。本文讨论了面积-功率优化混合并联前缀Ling加法器的设计与实现。本文采用的混合加法器拓扑结构对偶索引位采用Ladner-Fischer方法,对奇索引位采用Kogge-Stone结构。奇数位和偶数位进位的独立计算,直接减少了前缀树的扇出,从而降低了延迟。面积效率是利用修正的凌氏方程计算实载波来实现的。基于修正凌方程,采用0.18 μm CMOS技术实现字长分别为16位和32位的加法器。综合结果表明,与基于传统凌方程的加法器相比,该加法器的面积功率积和功率延迟积分别可节省24%和35%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Area Efficient Hybrid Parallel Prefix Adders

Addition is a timing critical operation in almost all modern processing units. The performance parameters such as the implementation area, the adder latency and the power dissipation decide the choice of adders for different applications. Hence, there is an extensive research attention towards designing higher speed and less complex adder architectures with lower power dissipation. Among the several adder topologies available, parallel-prefix adders are the most frequently employed as they offer many design choices for achieving area/power/delay efficiency and they also provide optimization of the trade-offs. This paper discusses the design and implementation of area-power optimized hybrid parallel-prefix Ling adder. The hybrid adder topology employed in this work uses Ladner-Fischer approach for even-indexed and Kogge-Stone structure for odd-indexed bits. The independent computation of carries for odd and even bits, directly leads to the reduction of fan-out of the prefix tree and thereby a reduced delay. The area efficiency is achieved by the computation of the real carries using modified Ling's equations. The proposed adders are implemented with word size of 16 bit and 32 bit based on modified Ling equations using 0.18 μm CMOS technology. The synthesis results reveal that the proposed adders could achieve up to 24% and 35% saving of area-power product and power-delay product respectively, over the adders based on conventional Ling equations.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信