discrete cosine transform

ANALYSIS OF THE ERROR OF COMPUTATION FAST TRANSFORMS OF FOURIER CLASS BASED ON CYCLIC CONVOLUTIONS

The features of the computational model of discrete transforms of Fourier class based on cyclic convolutions to determine the algorithmic calculation error are analyzed. Based on the approach of efficient computation of discrete transforms of Fourier class of arbitrary size N, using of a hashing array to transform a discrete basis matrix into a set of block-cyclic submatrices, the components of computational costs are considered. These components of computational costs depend on the type of transform, the size and the block-cycle structure of the transformation core.

Efficiency Analysis of Wavelet Transform in Hidden Data Problems

Today embedding digital watermarks is one of the most effective means of protecting intellectual property. The paper made a comparative analysis of different wavelets, investigated under different coefficients of embedding and embedding in different sub bands for transformation methods for hidden data transmission using wavelets.