Computational structure of DST-II using convolvers

Abstract

The computational structure of discrete sine transform (DST) using convolvers is considered. Hashing arrays on the basis of simplified arguments of basis DST of type II for size N=2 n , 3 n and computational structure are analyzed, what eliminate the analysis of the identity the cyclic submatrices in the basis matrix of DST-II transforms.Кеу wordsdiscrete sine transform, hashing array, computational structure, convolver, transform size.