论文信息 - On computing the two-dimensional (2-D) type IV discrete cosine transform (2-D DCT-IV)

On computing the two-dimensional (2-D) type IV discrete cosine transform (2-D DCT-IV)

A new fast N/spl times/M two-dimensional (2-D) type IV discrete cosine transform (2-D DCT-IV) algorithm is proposed by jointly using the one-dimensional (1-D) polynomial transform (1-D PT) and the N length-M 1-D DCTs. Compared to the known row-column method, the proposed algorithm requires less than one-half of number of multiplications and a smaller number of additions.

Li Zhi Cheng

[1] Yonghong Zeng,et al. Multidimensional polynomial transform algorithm for multidimensional DFT , 2000 .

[2] Didier Le Gall,et al. MPEG: a video compression standard for multimedia applications , 1991, CACM.

[3] Zhongde Wang. Fast algorithms for the discrete W transform and for the discrete Fourier transform , 1984 .

[4] Hideo Kitajima. A Symmetric Cosine Transform , 1980, IEEE Transactions on Computers.

[5] Anil K. Jain,et al. A Sinusoidal Family of Unitary Transforms , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6] P. Yip,et al. Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .

[7] Shing-Chow Chan,et al. Multiplierless perfect reconstruction modulated filter banks with sum-of-powers-of-two coefficients , 2001, IEEE Signal Processing Letters.

[8] Pierre Duhamel,et al. A polynomial-transform based computation of the 2-D DCT with minimum multiplicative complexity , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

[9] Henrique S. Malvar. Extended lapped transforms: properties, applications, and fast algorithms , 1992, IEEE Trans. Signal Process..

[10] N. Ahmed,et al. Discrete Cosine Transform , 1996 .

[11] N. Rama Murthy,et al. On the on-line computation of DCT-IV and DST-IV transforms , 1995, IEEE Trans. Signal Process..