Study of computational complication of the computer circuit binary convolution algorithms

Various convolution algorithms are analyzed: with balanced and unbalanced convolution, without preliminary analysis and taking into account the connectivity of circuit elements. The computational complication of the algorithms is theoretically derived as a function of the circuit elements number and some of its other characteristics. Constraints on using the theoretical results are imposed. Experimental results of the computational complication evaluation, based on running the programs, which implement the above algorithms for electric circuits with statistical average parameters, are presented.