基于区域高效存储器的高输入偶数多存储乘法器

Gagan Abbot, Dhruv Sharma
{"title":"基于区域高效存储器的高输入偶数多存储乘法器","authors":"Gagan Abbot, Dhruv Sharma","doi":"10.1109/Indo-TaiwanICAN48429.2020.9181319","DOIUrl":null,"url":null,"abstract":"VLSI architecture design of DSP focuses on designtechniques for the realization of a dedicated Very Large Scale Integrated (VLSI) systems for signal processing, image processing, and other communication applications. The VLSI design techniques and systolic architectures will be used for exploring the speed-area-power tradeoffs for different DSP applications. Memory-based structures are a pertinent and fitting choice for a large number of signal processing implementations that implicate multiplication with a certain set of coefficients. In this paper, however, we show a memory-based approach that can be advantageous for reduced-latency and area reducing implementations in which memory processing time is shorter than the normal computation-time effectuated in traditional multipliers. The key factor of our paper is lookup table (LUT) optimization which reduces the area and power, also a pipelined version of the memory-based multiplier reduces the combinational path delay.","PeriodicalId":171125,"journal":{"name":"2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Area Efficient Memory-Based Even-Multiple-Storage Multiplier for Higher Input\",\"authors\":\"Gagan Abbot, Dhruv Sharma\",\"doi\":\"10.1109/Indo-TaiwanICAN48429.2020.9181319\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"VLSI architecture design of DSP focuses on designtechniques for the realization of a dedicated Very Large Scale Integrated (VLSI) systems for signal processing, image processing, and other communication applications. The VLSI design techniques and systolic architectures will be used for exploring the speed-area-power tradeoffs for different DSP applications. Memory-based structures are a pertinent and fitting choice for a large number of signal processing implementations that implicate multiplication with a certain set of coefficients. In this paper, however, we show a memory-based approach that can be advantageous for reduced-latency and area reducing implementations in which memory processing time is shorter than the normal computation-time effectuated in traditional multipliers. The key factor of our paper is lookup table (LUT) optimization which reduces the area and power, also a pipelined version of the memory-based multiplier reduces the combinational path delay.\",\"PeriodicalId\":171125,\"journal\":{\"name\":\"2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN)\",\"volume\":\"125 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/Indo-TaiwanICAN48429.2020.9181319\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/Indo-TaiwanICAN48429.2020.9181319","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

超大规模集成电路(VLSI)体系结构设计侧重于DSP的设计技术,以实现专用的超大规模集成电路(VLSI)系统,用于信号处理、图像处理和其他通信应用。VLSI设计技术和收缩架构将用于探索不同DSP应用的速度-面积-功率权衡。基于内存的结构对于大量的信号处理实现来说是一个合适的选择,这些信号处理实现包含一组特定系数的乘法。然而,在本文中,我们展示了一种基于内存的方法,它有利于减少延迟和减少面积的实现,其中内存处理时间比传统乘法器中实现的正常计算时间短。本文的关键因素是查找表(LUT)优化,它减少了面积和功耗,并且基于内存的乘法器的流水线版本减少了组合路径延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Area Efficient Memory-Based Even-Multiple-Storage Multiplier for Higher Input
VLSI architecture design of DSP focuses on designtechniques for the realization of a dedicated Very Large Scale Integrated (VLSI) systems for signal processing, image processing, and other communication applications. The VLSI design techniques and systolic architectures will be used for exploring the speed-area-power tradeoffs for different DSP applications. Memory-based structures are a pertinent and fitting choice for a large number of signal processing implementations that implicate multiplication with a certain set of coefficients. In this paper, however, we show a memory-based approach that can be advantageous for reduced-latency and area reducing implementations in which memory processing time is shorter than the normal computation-time effectuated in traditional multipliers. The key factor of our paper is lookup table (LUT) optimization which reduces the area and power, also a pipelined version of the memory-based multiplier reduces the combinational path delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信