高速高效n位数字CMOS比较器的VLSI实现

S. Karunakaran, K. Pavan, P. Reddy
{"title":"高速高效n位数字CMOS比较器的VLSI实现","authors":"S. Karunakaran, K. Pavan, P. Reddy","doi":"10.1109/ICSTCEE54422.2021.9708574","DOIUrl":null,"url":null,"abstract":"This paper deals with a comparator with N bits which is efficient in terms of area and operates at high speed with power dissipation as low as possible. Area and power necessities can be scaled down by this proposed digital comparator. Among all the arithmetic operations comparison is the most basic. This operation directs if one number is less than, greater than, or equals to the other number. In our proposed model comparison is carried out bit wise up to least significant from most significant bit , when bits are equal only then comparison forgoes ,which is called as parallel prefix tree structure is exercised. This proposed methodology of comparator structure comprises of two independent modules .Comparison evaluation unit (CEU) and final unit (FU) named first and second units respectively. For implementing tree structure results obtained from systematic structure of repeated logic cells is validated. By depending on the outcomes of CEU, FU module authenticates the result. The presence of structured VLSI methodology in the mooted architecture grants the area derivation through analytical method relating transistors count and entire total delay can be seen in terms of operand bit width. By making use of 0.18 micron CMOS technology at 1 GHz spectre simulations have been performed. Using this proposed design, power consumption reduced by 77.76% and operating speed had increased by 31.92% when compared with existing model.","PeriodicalId":146490,"journal":{"name":"2021 Second International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"VLSI Implementation of a High Speed and Area efficient N-bit Digital CMOS Comparator\",\"authors\":\"S. Karunakaran, K. Pavan, P. Reddy\",\"doi\":\"10.1109/ICSTCEE54422.2021.9708574\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with a comparator with N bits which is efficient in terms of area and operates at high speed with power dissipation as low as possible. Area and power necessities can be scaled down by this proposed digital comparator. Among all the arithmetic operations comparison is the most basic. This operation directs if one number is less than, greater than, or equals to the other number. In our proposed model comparison is carried out bit wise up to least significant from most significant bit , when bits are equal only then comparison forgoes ,which is called as parallel prefix tree structure is exercised. This proposed methodology of comparator structure comprises of two independent modules .Comparison evaluation unit (CEU) and final unit (FU) named first and second units respectively. For implementing tree structure results obtained from systematic structure of repeated logic cells is validated. By depending on the outcomes of CEU, FU module authenticates the result. The presence of structured VLSI methodology in the mooted architecture grants the area derivation through analytical method relating transistors count and entire total delay can be seen in terms of operand bit width. By making use of 0.18 micron CMOS technology at 1 GHz spectre simulations have been performed. Using this proposed design, power consumption reduced by 77.76% and operating speed had increased by 31.92% when compared with existing model.\",\"PeriodicalId\":146490,\"journal\":{\"name\":\"2021 Second International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 Second International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSTCEE54422.2021.9708574\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Second International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTCEE54422.2021.9708574","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了一种N位比较器,该比较器在面积上是高效的,在高速度下运行,功耗尽可能低。该数字比较器可以减小面积和功率需求。在所有的算术运算中,比较运算是最基本的。该操作指示一个数字是否小于、大于或等于另一个数字。在我们提出的模型中,比较是从最高有效位到最低有效位进行的,当位相等时才放弃比较,这被称为并行前缀树结构。该比较物结构方法包括两个独立的模块:比较评价单元(CEU)和最终单元(FU),分别命名为第一单元和第二单元。为实现树形结构,验证了由重复逻辑单元系统结构得到的结果。通过依赖CEU的结果,FU模块对结果进行验证。在讨论的体系结构中存在结构化VLSI方法,通过分析方法将晶体管数量和整个总延迟与操作数位宽度相关,从而获得面积推导。利用0.18微米CMOS技术在1ghz波段进行了光谱模拟。采用该设计,与现有机型相比,功耗降低77.76%,运行速度提高31.92%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
VLSI Implementation of a High Speed and Area efficient N-bit Digital CMOS Comparator
This paper deals with a comparator with N bits which is efficient in terms of area and operates at high speed with power dissipation as low as possible. Area and power necessities can be scaled down by this proposed digital comparator. Among all the arithmetic operations comparison is the most basic. This operation directs if one number is less than, greater than, or equals to the other number. In our proposed model comparison is carried out bit wise up to least significant from most significant bit , when bits are equal only then comparison forgoes ,which is called as parallel prefix tree structure is exercised. This proposed methodology of comparator structure comprises of two independent modules .Comparison evaluation unit (CEU) and final unit (FU) named first and second units respectively. For implementing tree structure results obtained from systematic structure of repeated logic cells is validated. By depending on the outcomes of CEU, FU module authenticates the result. The presence of structured VLSI methodology in the mooted architecture grants the area derivation through analytical method relating transistors count and entire total delay can be seen in terms of operand bit width. By making use of 0.18 micron CMOS technology at 1 GHz spectre simulations have been performed. Using this proposed design, power consumption reduced by 77.76% and operating speed had increased by 31.92% when compared with existing model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信