Implementing the method of figurative transformations to minimize partially defined Boolean functions
Open Access
- 28 February 2023
- journal article
- research article
- Published by Private Company Technology Center in Eastern-European Journal of Enterprise Technologies
- Vol. 1 (4 (121)) , 6-25
Abstract
This paper reports a research that established the possibility of increasing the effectiveness of the method of figurative transformations to minimize partially defined Boolean functions. The method makes it possible, without loss of functionality, to reduce the complexity of the minimization procedure, compared to sorting out binary definitions of partially defined Boolean functions. The interpretation of the result is that the 2-(n, b)-design, 2-(n, x/b)-design systems are a reflection of logical operations. Therefore, the identification of such combinatorial systems in the truth table of logical functions directly and unambiguously establishes the location of logical operations for equivalent transformations of Boolean expressions. This, in turn, implicates an algorithm for simplifying Boolean functions, including partially defined Boolean functions. Thus, the method of figurative transformations simplifies and speeds up the procedure for minimizing partially defined Boolean functions, compared to analogs. This indicates that the visual-matrix form of the analytical method still has the prospect of increasing its hardware capabilities, including in terms of minimizing partially defined Boolean functions. It has been experimentally confirmed that the method of figurative transformations increases the efficiency of minimizing partially defined Boolean functions, compared with analogs, by 100–200 %. There is reason to argue about the possibility of increasing the efficiency of minimizing partially defined Boolean functions in the main and polynomial bases by the specified method. The effectiveness of the method, in particular, is ensured by carrying out all operations of generalized gluing of variables for dead-end disjunctive normal forms (DNF), followed by the use of implicant tables; optimal combination of a sequence of logical operations for gluing variablesKeywords
This publication has 14 references indexed in Scilit:
- Accuracy recovery: A decomposition procedure for the synthesis of partially-specified Boolean functionsIntegration, 2022
- Multi‐output, multi‐level, multi‐gate design using non‐linear programmingInternational Journal of Circuit Theory and Applications, 2022
- Developing the minimization of a polynomial normal form of boolean functions by the method of figurative transformationsEastern-European Journal of Enterprise Technologies, 2021
- Developing an algorithm to minimize boolean functions for the visual-matrix form of the analytical methodEastern-European Journal of Enterprise Technologies, 2021
- Learning Boolean Circuits from Examples for Approximate Logic Synthesis2021
- Devising a method of figurative transformations for minimizing boolean functions in the implicative basisEastern-European Journal of Enterprise Technologies, 2020
- The algorithm for minimizing Boolean functions using a method of the optimal combination of the sequence of figurative transformationsEastern-European Journal of Enterprise Technologies, 2020
- A Nonlinear Integer Programming Approach for the Minimization of Boolean ExpressionsJournal of Circuits, Systems and Computers, 2018
- Minimizing ROBDD sizes of incompletely specified Boolean functions by exploiting strong symmetries2002
- Xiao map for minimization of boolean expressionInternational Journal of Electronics, 1987