Abstract

The object of research is the combinatorial method of minimizing conjunctive normal forms (CNF) of Boolean functions in order to reduce its algorithmic complexity. One of the most places to minimize CNF of Boolean functions is the complexity of the minimization algorithm and the guarantee of obtaining the minimum function. In the course of the study, the method of equivalent figurative transformations based on the laws and axioms of the algebra of logic, protocols for minimizing CNF of Boolean functions is used. The reduction of the computational complexity of the process of minimization of the CNF of the Boolean functions by the combinatorial method according to the new established criteria has been obtained, thanks to the use of a number of features of the algorithm for finding minimal disjunctive normal forms (DNF) and CNF of logical functions, in particular the use of the mathematical apparatus of transforming flowcharts with repetition allows to increase the information component of the figurative transformation with respect to the orthogonality, adjacency, uniqueness of truth table blocks; equivalent figurative transformations allow with the effect to replace verbal procedures of algebraic transformations due to the greater information capacity of matrix images; result of minimization is estimated on the basis of the minimal function; minimal DNF or CNF of the functions are obtained regardless of the normal form of the given logical function; minimization protocols for CNF of Boolean functions make up a library of protocols for the process of minimization of CNF of Boolean functions as standard procedures. Due to the above, it is possible to optimally reduce the number of variables of a given function without losing its functionality. The effectiveness of the use of figurative transformations is demonstrated by examples of minimizing functions borrowed from other methods for the purpose of comparison. Compared with similar known methods of minimizing Boolean functions, the proposed method allows reduce the algorithmic complexity of minimizing CNF of Boolean functions; increase the visibility of the minimization process of DNF or CNF of Boolean functions; ensure the self-sufficiency of the combinatorial method of minimizing Boolean functions by introducing features of the minimal function and minimization on the full table of DNF and CNF.

Highlights

  • Об’єктом дослідження є комбінаторний метод мінімізації кон’юктивних нормальних форм (КНФ) булевих функцій з метою зменшення його алгоритмічної складності

  • This paper presents a combinatorial method for Boolean computation with an increase in the number of variable functions minimization in the conjunctive normal forms (CNF) class of logic functions

  • The effectiveness of the use of figurative transforma­ tions of the combinatorial method for minimizing CNF of Boolean functions is significantly reducing the com­ plexity of the procedure for reducing logical functions

Read more

Summary

The aim and objectives of research

The aim of research is simplification of the process of minimizing the CNF of the Boolean functions by the combinatorial method. To achieve this aim it is necessary to solve the following tasks: 1. To establish the adequacy of the application of the combinatorial method to minimize the CNF of the Boolean functions. 2. To determine equivalent figurative transformations of a disjunctive maxterms to minimize the CNF of Boolean functions. 3. To establish the feasibility of the use of figurative transformations to obtain the signs of the minimum logi­ cal function. 4. To establish the feasibility of using figurative trans­ formations to minimize the two normal forms – DNF and CNF of a given Boolean function, using the full truth table

Research of existing solutions of the problem
Research results
SWOT analysis of research results
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call