Realization of Conditional-Sum Adders With Low Latency Time

A. Rothermel, B. Hosticka, G. Troster, J. Arndt
{"title":"Realization of Conditional-Sum Adders With Low Latency Time","authors":"A. Rothermel, B. Hosticka, G. Troster, J. Arndt","doi":"10.1109/ESSCIRC.1988.5468258","DOIUrl":null,"url":null,"abstract":"Conditional-sum adders have been realized in a standard 2.5 ¿m CMOS technology. These adders offer short propagation delay and latency time (12.5 ns for 32 bit addition) and consume only moderate chip area (i.e. 80 × 460 ¿m2 for one bit in a 32 bit adder). The adders have been realized with CMOS transmission-gates. They allow static operation and consume only dynamic power (like standard CMOS). The layout exhibits high regularity and can be easily adjusted to various word-lengths.","PeriodicalId":197244,"journal":{"name":"ESSCIRC '88: Fourteenth European Solid-State Circuits Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ESSCIRC '88: Fourteenth European Solid-State Circuits Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ESSCIRC.1988.5468258","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Conditional-sum adders have been realized in a standard 2.5 ¿m CMOS technology. These adders offer short propagation delay and latency time (12.5 ns for 32 bit addition) and consume only moderate chip area (i.e. 80 × 460 ¿m2 for one bit in a 32 bit adder). The adders have been realized with CMOS transmission-gates. They allow static operation and consume only dynamic power (like standard CMOS). The layout exhibits high regularity and can be easily adjusted to various word-lengths.
低延时条件和加法器的实现
条件和加法器已在标准的2.5 m CMOS技术中实现。这些加法器提供较短的传播延迟和延迟时间(32位加法12.5 ns),并且仅消耗适度的芯片面积(即32位加法器中每位80 × 460¿m2)。加法器是用CMOS传输门实现的。它们允许静态操作,只消耗动态功率(如标准CMOS)。布局具有高度的规律性,可以很容易地调整到不同的字长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信