改进加权和法最小项生成算法

Jishan Mehedi, Souvik Paul, R. Upadhyay
{"title":"改进加权和法最小项生成算法","authors":"Jishan Mehedi, Souvik Paul, R. Upadhyay","doi":"10.1109/ICRCICN.2017.8234535","DOIUrl":null,"url":null,"abstract":"This paper proposed a Boolean expression simplification method with reduced complexity. To avoid bulky size of the truth table for multiple input combinational circuits, a reduced truth table is proposed here and this methodology is able to reduce its present size. This paper discusses about the generation of minterms from the SOP form of the Boolean expression. Here any input system is described as SOP form and represented by a matrix. This paper shows the effectiveness for reducing the computational complexity for Boolean expression simplification.","PeriodicalId":166298,"journal":{"name":"2017 Third International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Modified minterms genarations algorithm using weighted sum method\",\"authors\":\"Jishan Mehedi, Souvik Paul, R. Upadhyay\",\"doi\":\"10.1109/ICRCICN.2017.8234535\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposed a Boolean expression simplification method with reduced complexity. To avoid bulky size of the truth table for multiple input combinational circuits, a reduced truth table is proposed here and this methodology is able to reduce its present size. This paper discusses about the generation of minterms from the SOP form of the Boolean expression. Here any input system is described as SOP form and represented by a matrix. This paper shows the effectiveness for reducing the computational complexity for Boolean expression simplification.\",\"PeriodicalId\":166298,\"journal\":{\"name\":\"2017 Third International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Third International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRCICN.2017.8234535\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Third International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRCICN.2017.8234535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种降低复杂度的布尔表达式简化方法。为了避免多输入组合电路的真值表过于庞大,本文提出了一种简化的真值表,该方法能够减小其目前的大小。本文讨论了从布尔表达式的SOP形式生成最小项的问题。这里,任何输入系统都被描述为SOP形式,并用矩阵表示。本文证明了布尔表达式简化降低计算复杂度的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Modified minterms genarations algorithm using weighted sum method
This paper proposed a Boolean expression simplification method with reduced complexity. To avoid bulky size of the truth table for multiple input combinational circuits, a reduced truth table is proposed here and this methodology is able to reduce its present size. This paper discusses about the generation of minterms from the SOP form of the Boolean expression. Here any input system is described as SOP form and represented by a matrix. This paper shows the effectiveness for reducing the computational complexity for Boolean expression simplification.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
RGB image encryption using hyper chaotic system Characterisation of wireless network traffic: Fractality and stationarity Security risk assessment in online social networking: A detailed survey Optimalized hydel-thermic operative planning using IRECGA Designing an enhanced ZRP algorithm for MANET and simulation using OPNET
×
引用
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