High performance parallel multiplier using Wallace-Booth algorithm

Lakshmanan, M. Othman, M.A.M. Ali
{"title":"High performance parallel multiplier using Wallace-Booth algorithm","authors":"Lakshmanan, M. Othman, M.A.M. Ali","doi":"10.1109/SMELEC.2002.1217859","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient implementation of a VLSI high speed parallel multiplier using the Radix/spl I.bar/4 modified Booth algorithm and the Wallace Tree structure. The design is structured for a n/spl times/m multiplication where n can reach up to 126 bits. The Wallace Tree structure serves to compress the partial product term by a ratio of 3:2. To enhance the speed of operation, carry-look-ahead(CLA) adders are used which is independent on the number of bits of the two operands. An efficient VHDL code was written and successfully simulated and synthesised using Altera's MaxplusII(10.0) and ModelSim3.4 CAD tools.","PeriodicalId":211819,"journal":{"name":"ICONIP '02. Proceedings of the 9th International Conference on Neural Information Processing. Computational Intelligence for the E-Age (IEEE Cat. No.02EX575)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2002-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICONIP '02. Proceedings of the 9th International Conference on Neural Information Processing. Computational Intelligence for the E-Age (IEEE Cat. No.02EX575)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMELEC.2002.1217859","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 41

Abstract

This paper presents an efficient implementation of a VLSI high speed parallel multiplier using the Radix/spl I.bar/4 modified Booth algorithm and the Wallace Tree structure. The design is structured for a n/spl times/m multiplication where n can reach up to 126 bits. The Wallace Tree structure serves to compress the partial product term by a ratio of 3:2. To enhance the speed of operation, carry-look-ahead(CLA) adders are used which is independent on the number of bits of the two operands. An efficient VHDL code was written and successfully simulated and synthesised using Altera's MaxplusII(10.0) and ModelSim3.4 CAD tools.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
采用Wallace-Booth算法的高性能并行乘法器
本文提出了一种利用Radix/spl I.bar/4改进的Booth算法和Wallace树结构高效实现VLSI高速并行乘法器的方法。该设计结构为n/spl次/m乘法,其中n可以达到126位。华莱士树结构以3:2的比例压缩部分乘积项。为了提高运算速度,采用了与两个操作数的位数无关的前移加法器(CLA)。使用Altera的MaxplusII(10.0)和ModelSim3.4 CAD工具编写了高效的VHDL代码,并成功地进行了模拟和合成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Characterization and optimization of inorganic spin on glass process for inter-metal dielectric using field emission scanning electron microscopy Ion chromatography analysis of fluorine contamination in wafer packaging materials Real-time monitoring user certification and validation system Power stabilization of erbium-doped fibre ring laser subjected to external injection A study of non-linearity effects of collector and base currents in SiGe heterojunction bipolar transistor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1