{"title":"Implementation of a System of Incompletely Specified Boolean Functions in a Circuit of Two-Input Gates by Means of Bi-Decomposition","authors":"Yu. V. Pottosin","doi":"10.1134/s1064230724700205","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The problem of bi-decomposition of a Boolean function is to represent a given Boolean function as a logic algebra operation over two Boolean functions. A method based on bi-decomposition of Boolean functions is suggested to implement systems of incompletely specified (partial) Boolean functions in the basis of two-input gates. This basis can be the basis of NOR gates, NAND gates or the basis of AND and OR gates with accessible input complements. The used method for bi-decomposition is reduced to the search for weighted two-block cover of a complete bipartite weighted graph with complete bipartite subgraphs (bi-cliques). The graph represents differences between the rows of Boolean matrices that specify the given system of partial Boolean functions. The system is given by two Boolean matrices, one of which represents the domain of Boolean space where the values of the given functions are specified, and the other—the values of the functions on the elements of the domain. Every bi-clique in the obtained cover is assigned in a certain way with а set of variables that are the arguments of the functions. This set is the weight of the bi-clique. Every one of those bi-cliques defines a Boolean function whose arguments are the variables assigned to it. The functions obtained in such a way constitute the required decomposition. The process of synthesis of a combinational circuit consists in successive application of bi-decomposition to the obtained functions. The method for two-block covering the orthogonality graph of rows of ternary matrices is described.</p>","PeriodicalId":50223,"journal":{"name":"Journal of Computer and Systems Sciences International","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and Systems Sciences International","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s1064230724700205","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
The problem of bi-decomposition of a Boolean function is to represent a given Boolean function as a logic algebra operation over two Boolean functions. A method based on bi-decomposition of Boolean functions is suggested to implement systems of incompletely specified (partial) Boolean functions in the basis of two-input gates. This basis can be the basis of NOR gates, NAND gates or the basis of AND and OR gates with accessible input complements. The used method for bi-decomposition is reduced to the search for weighted two-block cover of a complete bipartite weighted graph with complete bipartite subgraphs (bi-cliques). The graph represents differences between the rows of Boolean matrices that specify the given system of partial Boolean functions. The system is given by two Boolean matrices, one of which represents the domain of Boolean space where the values of the given functions are specified, and the other—the values of the functions on the elements of the domain. Every bi-clique in the obtained cover is assigned in a certain way with а set of variables that are the arguments of the functions. This set is the weight of the bi-clique. Every one of those bi-cliques defines a Boolean function whose arguments are the variables assigned to it. The functions obtained in such a way constitute the required decomposition. The process of synthesis of a combinational circuit consists in successive application of bi-decomposition to the obtained functions. The method for two-block covering the orthogonality graph of rows of ternary matrices is described.
摘要 布尔函数的双分解问题是将给定的布尔函数表示为两个布尔函数的逻辑代数运算。本文提出了一种基于布尔函数双分解的方法,用于在双输入门的基础上实现不完全指定(部分)布尔函数系统。这种基础可以是 NOR 门、NAND 门或具有可访问输入补码的 AND 和 OR 门的基础。所使用的双分解方法简化为在一个完整的双栅格加权图中寻找具有完整双栅格子图(双栅格)的加权双块覆盖。该图表示布尔矩阵各行之间的差异,这些布尔矩阵指定了给定的部分布尔函数系统。该系统由两个布尔矩阵给出,其中一个矩阵表示布尔空间的域,在该域中指定了给定函数的值,另一个矩阵表示域元素上的函数值。在所得到的覆盖中,每个双层矩阵都以某种方式分配了作为函数参数的 а 组变量。这组变量就是双壳的权重。每个双阙都定义了一个布尔函数,其参数就是分配给它的变量。以这种方式获得的函数构成了所需的分解。组合电路的合成过程包括对获得的函数连续应用双分解。本文介绍了对三元矩阵行的正交图进行两块覆盖的方法。
期刊介绍:
Journal of Computer and System Sciences International is a journal published in collaboration with the Russian Academy of Sciences. It covers all areas of control theory and systems. The journal features papers on the theory and methods of control, as well as papers devoted to the study, design, modeling, development, and application of new control systems. The journal publishes papers that reflect contemporary research and development in the field of control. Particular attention is given to applications of computer methods and technologies to control theory and control engineering. The journal publishes proceedings of international scientific conferences in the form of collections of regular journal articles and reviews by top experts on topical problems of modern studies in control theory.