Novel High-Speed Architecture for 32-Bit Binary Coded Decimal (BCD) Multiplier

S. Veeramachaneni, M. Srinivas
{"title":"Novel High-Speed Architecture for 32-Bit Binary Coded Decimal (BCD) Multiplier","authors":"S. Veeramachaneni, M. Srinivas","doi":"10.1109/ISCIT.2008.4700251","DOIUrl":null,"url":null,"abstract":"With the increasing prominence of commercial, financial and Internet-based applications that process data in decimal format, there is a renewed interest in providing hardware support to handle such data. In this paper, novel efficient parallel architectures for 32-digit binary coded decimal (BCD) multipliers are proposed using novel binary counters, BCD full adders and binary to BCD converters. These binary counters have been designed and used to add the partial products generated during multiplication using a partial product reduction tree. The proposed architecture focuses on using efficient binary architectures to compute BCD products without the loss of accuracy. The existing and proposed architectures have been simulated and compared (both qualitatively and quantitatively) and the results have been mentioned.","PeriodicalId":215340,"journal":{"name":"2008 International Symposium on Communications and Information Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Communications and Information Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2008.4700251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

With the increasing prominence of commercial, financial and Internet-based applications that process data in decimal format, there is a renewed interest in providing hardware support to handle such data. In this paper, novel efficient parallel architectures for 32-digit binary coded decimal (BCD) multipliers are proposed using novel binary counters, BCD full adders and binary to BCD converters. These binary counters have been designed and used to add the partial products generated during multiplication using a partial product reduction tree. The proposed architecture focuses on using efficient binary architectures to compute BCD products without the loss of accuracy. The existing and proposed architectures have been simulated and compared (both qualitatively and quantitatively) and the results have been mentioned.
32位二进制编码十进制(BCD)乘法器的新型高速结构
随着以十进制格式处理数据的商业、金融和基于internet的应用程序的日益突出,人们对提供硬件支持来处理此类数据重新产生了兴趣。本文利用新型二进制计数器、BCD全加法器和二进制到BCD转换器,提出了32位二进制编码十进制(BCD)乘法器的新型高效并行架构。这些二进制计数器已被设计并用于添加使用部分乘积约简树的乘法过程中产生的部分乘积。所提出的体系结构侧重于在不损失精度的情况下使用高效的二进制体系结构来计算BCD产品。对现有的和提出的体系结构进行了模拟和比较(定性的和定量的),并提到了结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信