The Algorithm and Structures for Efficient Computation of Type II/III DCT/ DST/ DHT Using Cyclic Convolutions
Ihor Prots’ko
Lviv Polytechnic National University, Lviv, Ukraine
Abstract—The general approach to the synthesis of algorithm for efficient computation of type II/III DCT/DST/DHT transforms using cyclic convolutions is considered. The technique is based on a hashing array, which is formed on the basis of simplified arguments of the basis transform. The synthesis of algorithm owing to hashing arrays defines partitioning of the basis into submatrices which can identify and arrange the computation as cyclic convolutions. The example of synthesis of the algorithms and the common computation structures for type II/III DCT/DST/ DHT for the sizes of powers of two are presented.
Index Terms—discrete cosine transform (DCT), discrete sine transform (DST), discrete hartley transform (DHT), fast algorithm, cyclic convolution
Cite: Ihor Prots’ko, "The Algorithm and Structures for Efficient Computation of Type II/III DCT/ DST/ DHT Using Cyclic Convolutions," International Journal of Signal Processing Systems, Vol. 2, No. 2, pp. 119-127, December 2014. doi: 10.12720/ijsps.2.2.119-127
Cite: Ihor Prots’ko, "The Algorithm and Structures for Efficient Computation of Type II/III DCT/ DST/ DHT Using Cyclic Convolutions," International Journal of Signal Processing Systems, Vol. 2, No. 2, pp. 119-127, December 2014. doi: 10.12720/ijsps.2.2.119-127