{"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}
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.