High Performance Fast Multiplier

G. M. Chaudhary, F. Kharbash
{"title":"High Performance Fast Multiplier","authors":"G. M. Chaudhary, F. Kharbash","doi":"10.1109/TPSD.2008.4562751","DOIUrl":null,"url":null,"abstract":"Binary multiplication is very crucial arithmetic operations in digital signal processing systems as well as general computer systems because the performance of the processor is significantly influenced by the speed of their multipliers. In this paper, we present a design-methodology for high-speed multiplications, where two integers of n-bit size each are multiplied to produce a 2n-bit product. This paper presents an efficient method for performing multiplications in one step from the least significant bit towards the most significant bit.","PeriodicalId":410786,"journal":{"name":"2008 IEEE Region 5 Conference","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Region 5 Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TPSD.2008.4562751","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Binary multiplication is very crucial arithmetic operations in digital signal processing systems as well as general computer systems because the performance of the processor is significantly influenced by the speed of their multipliers. In this paper, we present a design-methodology for high-speed multiplications, where two integers of n-bit size each are multiplied to produce a 2n-bit product. This paper presents an efficient method for performing multiplications in one step from the least significant bit towards the most significant bit.
高性能快速倍增器
二进制乘法在数字信号处理系统和一般计算机系统中是非常重要的算术运算,因为处理器的性能受到其乘法器速度的显著影响。在本文中,我们提出了一种高速乘法的设计方法,其中两个n位大小的整数分别相乘以产生2n位的乘积。本文提出了一种从最低有效位到最高有效位一步进行乘法的有效方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信