S.V.Burmistrov, О.B.Piven

Annotations languages:

This article describes a new method of minimization of Boolean functions based on incremental decomposition, developed by the authors in the study of the orthogonal forms of representation of Boolean functions, the essence of which is to write a Boolean function as a disjunctive series. The advantage of this method is to minimize the acceleration time by 4.7 times compared with the previous modification of the method of parallel decomposition by increasing or decreasing the value of the base coefficient K. The results obtained by the proposed method are identical in terms of implementation complexity Sad, Sl, Ss results obtained by other methods.