Algorithm-based Study on Transformation Combination for Carry-free Modified Signed Digit(MSD) Addition

IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of Cloud Computing-Advances Systems and Applications Pub Date : 2023-07-01 DOI:10.1109/CSCloud-EdgeCom58631.2023.00058
Baofeng Qi, Shaojiang Sun, Yihui Tong, J. Zhang, Zhehe Wang, Xianchao Wang
{"title":"Algorithm-based Study on Transformation Combination for Carry-free Modified Signed Digit(MSD) Addition","authors":"Baofeng Qi, Shaojiang Sun, Yihui Tong, J. Zhang, Zhehe Wang, Xianchao Wang","doi":"10.1109/CSCloud-EdgeCom58631.2023.00058","DOIUrl":null,"url":null,"abstract":"Addition is the most basic operation in arithmetic. And the binary number system is used to implement the adder in modern electronic computer. The inherent properties of binary make it difficult to implement carry-free addition. And the redundancy of Modified Signed Digit(MSD) number system has been applied to implementing carry-free addition by use of four logic transformations. This paper explores in depth the reason why the MSD number system can be used to implement carry-free addition and obtain 16 pairs of transformation which can be used to implement MSD addition. Moreover, we obtain all transformation combinations for three-step MSD addition by designing relevant algorithms. Meanwhile, we find the test data set with minimum number of trits for MSD addition. Finally, to improve computational efficiency, we explore the optimal transformation combinations for implementation of MSD adder. And we find that there are four optimal transformation combinations, i.e. (5, 3, 0), (5, 3, 1), (10,2,0), and (10, 2, 4) which all use the same number of basic operating units(BOUs).","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"33 1","pages":"298-304"},"PeriodicalIF":3.7000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Cloud Computing-Advances Systems and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00058","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Addition is the most basic operation in arithmetic. And the binary number system is used to implement the adder in modern electronic computer. The inherent properties of binary make it difficult to implement carry-free addition. And the redundancy of Modified Signed Digit(MSD) number system has been applied to implementing carry-free addition by use of four logic transformations. This paper explores in depth the reason why the MSD number system can be used to implement carry-free addition and obtain 16 pairs of transformation which can be used to implement MSD addition. Moreover, we obtain all transformation combinations for three-step MSD addition by designing relevant algorithms. Meanwhile, we find the test data set with minimum number of trits for MSD addition. Finally, to improve computational efficiency, we explore the optimal transformation combinations for implementation of MSD adder. And we find that there are four optimal transformation combinations, i.e. (5, 3, 0), (5, 3, 1), (10,2,0), and (10, 2, 4) which all use the same number of basic operating units(BOUs).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于算法的无携带修改符号数字加法变换组合研究
加法是算术中最基本的运算。在现代电子计算机中,加法器是用二进制来实现的。二进制的固有性质使其难以实现无进位加法。并利用修正符号数(MSD)数系统的冗余性,利用四种逻辑变换实现了无进位加法。本文深入探讨了MSD数制可用于实现无进位加法的原因,得到了可用于实现MSD加法的16对变换。此外,通过设计相关算法,得到了三步MSD加法的所有变换组合。同时,我们找到了用于MSD添加的最小特征的测试数据集。最后,为了提高计算效率,我们探索了实现MSD加法器的最佳变换组合。我们发现有四种最优变换组合,即(5,3,0)、(5,3,1)、(10,2,0)和(10,2,4),它们都使用相同数量的基本操作单元(bou)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Cloud Computing-Advances Systems and Applications
Journal of Cloud Computing-Advances Systems and Applications Computer Science-Computer Networks and Communications
CiteScore
6.80
自引率
7.50%
发文量
76
审稿时长
75 days
期刊介绍: The Journal of Cloud Computing: Advances, Systems and Applications (JoCCASA) will publish research articles on all aspects of Cloud Computing. Principally, articles will address topics that are core to Cloud Computing, focusing on the Cloud applications, the Cloud systems, and the advances that will lead to the Clouds of the future. Comprehensive review and survey articles that offer up new insights, and lay the foundations for further exploratory and experimental work, are also relevant.
期刊最新文献
Research on electromagnetic vibration energy harvester for cloud-edge-end collaborative architecture in power grid FedEem: a fairness-based asynchronous federated learning mechanism Adaptive device sampling and deadline determination for cloud-based heterogeneous federated learning Review on the application of cloud computing in the sports industry Improving cloud storage and privacy security for digital twin based medical records
×
引用
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