A fast algorithm for the computation of 2-D forward and inverse MDCT
Signal Processing
Reassignment methods for robust time-frequency representations
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Sampling rate conversion based on DFT and DCT
Signal Processing
| Hi-index | 35.68 |
A new algorithm for the type-II multidimensional discrete cosine transform (MD-DCT) is proposed. Based on the polynomial transform, the rD-DCT with size N1×N2×···×N r, where Ni is a power of 2, can be converted into a series of one dimensional (1-D) discrete cosine transforms (DCTs). The algorithm achieves considerable savings on the number of operations compared with the row-column method. For example, the number of multiplications for computing an r-dimensional DCT is only 1/r times that needed by the row-column method, and the number of additions is also reduced. Compared with other known polynomial transform algorithms for MD-DCT and the most recently presented algorithm for MD-DCT, the proposed one uses about the same number of operations. However, advantages such as better computational structure and flexibility in the choice of dimensional sizes can be achieved