Some peculiarities of the designed logical circuit optimization

In solving the problem of multiterminal combination logical circuit synthesis, the circuit complexity (cost, dimension) and its operating speed are the criteria for optimization. While it is difficult to obtain an acceptable combination, a compromise between these parameters is recommended. By optimizing the two-level presentations, the minimal (short) function can be determined. The problem of the Boolean function minimization is the determination of the function minimal by the number of literals (minimal function) or by the number of conjunctions (short one). In optimizing multi-level presentations the methods of decomposition and factorization are used. Conjunctions factorization is the method of algebraic change of the conjunctions factors of one Boolean variable: factors including not less than two literals are extracted.