Abstract: The general method for efficient computation of discrete sine transform (DST) of sequences of arbitrary number of points using cyclic convolutions is considered. Forming hashing arrays on the basis of simplified arguments of basis sine transform for synthesis of efficient algorithm is analyzed. The hashing arrays in algorithm define partitioning of the basis into shift cyclic submatrices. The examples for size 8 of four types of DST I-IV using proposed method are analyzed. The hashing arrays, used in the algorithms of synthesis technique, are more versatile and generally better in terms of indexing mapping in comparison with the existing algorithms.
DOI: *As the DOI is a unique identifier, it is already available in the pdf version. **The DOI link will be activated in the first midst of January 2026.
WSEAS Transactions on Signal Processing, ISSN / E-ISSN: 1790-5052 / 2224-3488, Volume 10, 2014, Art. #28
Ihor Prots’ko, Vasyl Teslyuk, "Algorithm of Efficient Computation DSTI-IV Using Cyclic Convolutions," WSEAS Transactions on Signal Processing, vol. 10, pp. 277-287, 2014, DOI:
Ihor Prots’ko, Vasyl Teslyuk. Algorithm of Efficient Computation DSTI-IV Using Cyclic Convolutions.
WSEAS Transactions on Signal Processing. 2014;10:277-287.