Exploring factored forms for sequential implication logic synthesis

F. Marranghello, Mayler G. A. Martins, V. Callegaro, A. Reis, R. Ribas
{"title":"Exploring factored forms for sequential implication logic synthesis","authors":"F. Marranghello, Mayler G. A. Martins, V. Callegaro, A. Reis, R. Ribas","doi":"10.1109/NANO.2014.6967991","DOIUrl":null,"url":null,"abstract":"This work proposes the use of non-recursive factored forms in material implication logic as a way to increase performance with a small additional cost in the number of required devices. Previous works addressing memristor based implication logic focus only on recursive forms. The utilization of factored forms can reduce the number of operations. Since this kind of logic is naturally sequential, the number of operations is direct related to the computation time. However, additional devices may be needed. Considering all Boolean functions up to 4 inputs, the average reduction in the number of implications when using factored forms instead of recursive forms is 8%. The best case of reduction obtained was 60% by adding only one extra memristor.","PeriodicalId":367660,"journal":{"name":"14th IEEE International Conference on Nanotechnology","volume":"197 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"14th IEEE International Conference on Nanotechnology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NANO.2014.6967991","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This work proposes the use of non-recursive factored forms in material implication logic as a way to increase performance with a small additional cost in the number of required devices. Previous works addressing memristor based implication logic focus only on recursive forms. The utilization of factored forms can reduce the number of operations. Since this kind of logic is naturally sequential, the number of operations is direct related to the computation time. However, additional devices may be needed. Considering all Boolean functions up to 4 inputs, the average reduction in the number of implications when using factored forms instead of recursive forms is 8%. The best case of reduction obtained was 60% by adding only one extra memristor.
探索顺序蕴涵逻辑合成的因子形式
这项工作提出了在物质蕴涵逻辑中使用非递归因子形式,作为一种以所需设备数量的少量额外成本提高性能的方法。以前的工作解决基于忆阻器的隐含逻辑只关注递归形式。因式形式的使用可以减少运算的次数。由于这种逻辑是自然顺序的,因此操作的数量与计算时间直接相关。然而,可能需要额外的设备。考虑到最多4个输入的所有布尔函数,当使用因子形式而不是递归形式时,隐含数量的平均减少是8%。通过添加一个额外的忆阻器,获得的最佳还原效果为60%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信