Implementation of Basic Arithmetic Operations Using Cellular Automaton

P. Choudhury, Sudhakar Sahoo, Mithun Chakraborty
{"title":"Implementation of Basic Arithmetic Operations Using Cellular Automaton","authors":"P. Choudhury, Sudhakar Sahoo, Mithun Chakraborty","doi":"10.1109/ICIT.2008.18","DOIUrl":null,"url":null,"abstract":"This paper presents hardware architecture to perform the basic arithmetic operation addition using cellular automata (CA). This age old problem of addition were previously solved by ripple circuit or carry look ahead circuit or by using a combination of them. Each of these circuits is purely combinational in nature and their complexity is centered on the number of logic gates and the associated gate delays. On the contrary, in our CA based design the complexity is mainly centered on the number of clock cycles required to finish the computation instead of the gate delays.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"51","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2008.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 51

Abstract

This paper presents hardware architecture to perform the basic arithmetic operation addition using cellular automata (CA). This age old problem of addition were previously solved by ripple circuit or carry look ahead circuit or by using a combination of them. Each of these circuits is purely combinational in nature and their complexity is centered on the number of logic gates and the associated gate delays. On the contrary, in our CA based design the complexity is mainly centered on the number of clock cycles required to finish the computation instead of the gate delays.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用元胞自动机实现基本算术运算
本文介绍了利用元胞自动机(CA)进行基本算术运算加法的硬件结构。这个古老的加法问题以前是通过纹波电路或进位预判电路或使用它们的组合来解决的。这些电路中的每一个本质上都是纯组合的,它们的复杂性集中在逻辑门的数量和相关的门延迟上。相反,在我们基于CA的设计中,复杂性主要集中在完成计算所需的时钟周期数上,而不是门延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Overheads and Mean Route Failure Time of a Hybrid Protocol for Node-Disjoint Multipath Routing in Mobile Ad Hoc Networks Integrated Genomic Island Prediction Tool (IGIPT) Assignment of Cells to Switches in a Cellular Mobile Environment Using Swarm Intelligence Prediction of Protein Functional Sites Using Novel String Kernels Pairwise DNA Alignment with Sequence Specific Transition-Transversion Ratio Using Multiple Parameter Sets
×
引用
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