{"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}
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.