On the Possibility of Optimization of the Discrete Cosine Transform to Increase a Computation Speed

The DCT is widely used in compression algorithms and image decompression. Perhaps decline their resource consumption by optimizing DCT. In article descried optimization by means of decomposition the DCT matrix (dimension n = 4, 8 and 16) into dolled up multipliers especially for minimization multiplication. Moreover, it is will allow lower cost for storage matrix in memory. Obtained by decomposition differ maximum number of symmetric matrices. For n = 4 we got results with number of multiplications less results, which found in very popular beginning. Also during the study identified inconsistencies formula for the theoretical boundaries of the smallest number of multiplications and of this number in the resulting expansions.