[01] Ihor Prots’ko, Department of Civil Security, Lviv State University of Life Safety, Lviv, Ukraine.

The method of synthesis the efficient algorithms for types I, IV of discrete sine transform (DST) the sequences of arbitrary number of points via cyclic convolutions is considered. The hashing arrays with the simplified arguments of the basis function of sine for synthesis for the efficient algorithm of the arbitrary-number transform lengths is analyzed. The hashing arrays in the process of synthesis algorithm define partitioning of the basis into cyclic submatrices. The examples of the synthesis of the algorithms for I, IV types of DST using proposed method are considered. The hashing arrays, used in the algorithms for the synthesis technique, are more versatile and generally better in terms of indexing mapping in comparison with the existing algorithms.

Discrete Sine Transform, Types of DST, Fast Algorithm, Hashing Array, Synthesis, Cyclic Convolution

[01] Jain, A. K. (1976). A fast Karhunen-Loeve transform for a class of random processes. IEEE Trans. Commun., vol. COM-24, pp. 1023-1029. [02] Jain, A. K. (1979). A sinusoidal family of unitary transforms. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-1, pp. 356–365. [03] Wang, Z. (1982). A fast algorithm for the discrete sine transform implemented by the fast cosine transform. IEEE Transactions on Acoustics, Speech, and Signal Processing,vol. 30(5), pp. 814–815. [04] Rose, K., Heiman, A., and Dinstein, I. (1990). DCT/DST alternate-transform of image coding. IEEE Transactions on Communications, vol. 38(1), pp. 94–101. [05] Britanak, V., Yip, P., and Rao, K. R. (2007). Discrete Cosine and Sine Transforms. New York, NY: Academic Press. [06] Rader, C. M. (1968). Discrete Fourier transform when the number of data samples is prime. Proceeding of IEEE, 56, pp. 1107-1108. [07] Chiper, D. F. Swamy, M. N. S., Ahmad, M. O. (2013). A unified VLSI algorithm for a high performance systolic array implementation of type IV DCT/DST. International Symposium Signals, Circuits and Systems (ISSCS), pp.1- 4 [08] Meher, P. K. and Swamy, M. N. S. (2007). New systolic algorithm and array architecture for prime-length discrete sine transform. IEEE Transactions on Circuits and Systems II, vol. 54(3), pp. 262–266. [09] Murty, M. N. (2013). Realization of Prime-Length Discrete Sine Transform Using Cyclic Convolution. International Journal of Engineering Science and Technology (IJEST) vol. 5(03), pp. 583-589. [10] Murty, M. N. (2015) Algorithm for realization of Type-I Discrete Sine Transform. Ultra Scientist, vol. 27(2) A, pp. 164-168. [11] Agarwal, R. C, and Cooley, J. W. (1977). New algorithms for digital convolution. IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 25(5), pp. 392-409. [12] Wagh, M. D., Ganesh, H. (1980). A new algorithm for the discrete cosine transform of arbitrary number of points. IEEE Trans. on Computers, C-29 (4), pp. 269-277. [13] Prots’ko I., Patent 96540 Ukraine, G06F 17/16 (2006.01), H03M 7/30 (2006.01). [14] Prots’ko, I., Rikmas, R. (2011). Analysis cyclic submatrices in structure of basis discrete harmonic transform. Proceeding of the VIIth International Conference (MEMSTECH’ 2011), pp.64-66. [15] Breitzman, A. F. (2004). Automatic Derivation and Implementation of Fast Convolution Algorithms. Journal of High Performance Computing and Applications, special issue on ``Computer Algebra and Signal Processing'', vol. 37(2), pp. 157-186. [16] Britanak, V., Yip, P. C., Rao, K. R. (2007). Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations, Academic Press. [17] Egner, S. and Püschel M. (2001). Automatic Generation of Fast Discrete Signal Transforms. IEEE Transactions on Signal Processing, vol. 49(9), pp. 1992-2002.