Combined Polynomial Transform and Radix-q Algorithm for Multi-dimensional DCT-III
Multidimensional Systems and Signal Processing
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
| Hi-index | 35.68 |
A new fast algorithm for the type-II two-dimensional (2-D) discrete cosine transform (DCT) is presented. It shows that the 2-D DCT can be decomposed into cosine-cosine, cosine-sine, sine-cosine, and sine-sine sequences that can be further decomposed into a number of similar sequences. Compared with other reported algorithms, the proposed one achieves savings on the number of arithmetic operations and has a recursive computational structure that leads to a simplification of the input/output indexing process. Furthermore, the new algorithm supports transform sizes (p1*2m1)×(p2*2 m2), where p1 and p2 are arbitrarily odd integers, which provides a wider range of choices on transform sizes for various applications