Application of super-sticking algebraic operation of variables for Boolean functions minimization by combinatorial method
Autor: | Mykhailo Solomko, Volodymyr Riznyk |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2017 |
Předmět: |
Polynomial
050402 sociology 0211 other engineering and technologies Binary number 02 engineering and technology Disjunctive normal form lcsh:Business 0504 sociology 021105 building & construction Boolean function lcsh:Technology (General) minimization method Combinatorial method Mathematics minterm Discrete mathematics 05 social sciences Truth table Function (mathematics) super-sticking of variables block-diagram with repetition minimization of a logical function Algebraic operation lcsh:T1-995 lcsh:HF5001-6182 |
Zdroj: | Tehnologìčnij Audit ta Rezervi Virobnictva, Vol 6, Iss 2(38), Pp 60-76 (2017) |
ISSN: | 2312-8372 2226-3780 |
Popis: | The simplification of the problem of Boolean function minimization by a combinatorial method is a new procedure for the algebra of logic – super-sticking of variables. This procedure is performed if there is a complete binary combinatorial system with repetition or an incomplete binary combinatorial system with repetition in the truth table structure. The procedure for reducing the total perfect disjunctive normal form (PDNF) of the logical function gives unity. And since the complete PDNF uniquely determines the complete binary combinatorial system with repetition and vice versa, this gives grounds to delete all the blocks of the complete binary combinatorial system from the truth table, whose structure allows to carry out the rules of super-sticking of variables. The efficiency of the algebraic operation of supers-sticking of variables greatly simplifies the algorithm for Boolean function minimization and allows manual minimization of functions with a number of variables up to 10. The complexity of the algorithm for finding the minimal function by a combinatorial method is O(n) and is linear for n |
Databáze: | OpenAIRE |
Externí odkaz: |