{"title":"切换方程的最小参数解","authors":"J. Tucker, M. Tapia","doi":"10.1109/SECON.1994.324293","DOIUrl":null,"url":null,"abstract":"A new procedure is presented for solving equations in the two-valued Boolean algebra. The method has the advantage of expressing a general solution using the minimum number of binary parameters. The method guarantees that the complete set of all particular solutions can be generated from this general solution by assigning each parameter a value of either 0 or 1. The technique is presented using Karnaugh maps, but could easily be implemented in software.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Minimum parameter solution of switching equations\",\"authors\":\"J. Tucker, M. Tapia\",\"doi\":\"10.1109/SECON.1994.324293\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new procedure is presented for solving equations in the two-valued Boolean algebra. The method has the advantage of expressing a general solution using the minimum number of binary parameters. The method guarantees that the complete set of all particular solutions can be generated from this general solution by assigning each parameter a value of either 0 or 1. The technique is presented using Karnaugh maps, but could easily be implemented in software.<<ETX>>\",\"PeriodicalId\":119615,\"journal\":{\"name\":\"Proceedings of SOUTHEASTCON '94\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of SOUTHEASTCON '94\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.1994.324293\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of SOUTHEASTCON '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.1994.324293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new procedure is presented for solving equations in the two-valued Boolean algebra. The method has the advantage of expressing a general solution using the minimum number of binary parameters. The method guarantees that the complete set of all particular solutions can be generated from this general solution by assigning each parameter a value of either 0 or 1. The technique is presented using Karnaugh maps, but could easily be implemented in software.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
