Modified minterms genarations algorithm using weighted sum method

Jishan Mehedi, Souvik Paul, R. Upadhyay
{"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}
引用次数: 1

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.
改进加权和法最小项生成算法
本文提出了一种降低复杂度的布尔表达式简化方法。为了避免多输入组合电路的真值表过于庞大,本文提出了一种简化的真值表,该方法能够减小其目前的大小。本文讨论了从布尔表达式的SOP形式生成最小项的问题。这里,任何输入系统都被描述为SOP形式,并用矩阵表示。本文证明了布尔表达式简化降低计算复杂度的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信