切换方程的最小参数解

Proceedings of SOUTHEASTCON '94 Pub Date : 1994-04-10 DOI:10.1109/SECON.1994.324293

J. Tucker, M. Tapia

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

引用次数: 4

摘要

提出了一种求解二值布尔代数方程的新方法。该方法的优点是使用最小的二进制参数数来表示通解。该方法通过赋予每个参数一个0或1的值来保证所有特解的完整集可以从这个通解生成。这项技术是用卡诺图来展示的，但可以很容易地在软件中实现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Minimum parameter solution of switching equations

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of SOUTHEASTCON '94

自引率

0.00%

发文量

期刊最新文献

The use of wavelet transform as a preprocessor for the neural network detection of EEG spikes An output unit for low frequency square wave electronic ballasts The IBM Personal Communicator-design considerations Accelerating conversations for fault-tolerant concurrent software Application of three dimensional image analysis to the mammalian cell nucleus