Computational structure of DST-II using convolvers

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
ⁿ
, 3
ⁿ
and computational structure are analyzed, what eliminate the analysis of the identity the cyclic submatrices in the basis matrix of DST-II transforms.