Partial Boolean Functions Heuristic Method of Decomposition Combinational Logic
Institute of Information Theories and Applications FOI ITHEA
An original heuristic algorithm of sequential two-block decomposition of partial Boolean functions is
researched. The key combinatorial task is considered: finding of suitable partition on the set of arguments, i. e.
such one, on which the function is separable. The search for suitable partition is essentially accelerated by
preliminary detection of its traces. Within the framework of the experimental system the efficiency of the algorithm
is evaluated, the boundaries of its practical application are determined.