A new algorithm for the 2-D discrete cosine transform

Author

Baoyu, Zheng

Author_Institution

Nanjing Univ. of Posts & Telecommun., China

fYear

1998

fDate

1998

Firstpage

85

Abstract

A simple relation between the two-dimensional discrete cosine transform (2D DCT) and two-dimensional discrete W transform (2D DWT) is found for multidimensional signal processing. Using the relation, the 2D type-IV DCT (DCT-IV) can be mapped to a number of one-dimensional type-III DWT (DWT-III) by Ma´s (1989) real-valued FFT algorithm and the Wang (1992) mapping. Thus, a fast algorithm for 2D DCT-IV based on 1D DWT-III can be obtained. Computation efficiency of the proposed algorithm is higher than the existing algorithms for 2D DCT-IV

Keywords

discrete cosine transforms; fast Fourier transforms; multidimensional signal processing; 1D DWT-III; 2D DCT; 2D DCT-IV; 2D DWT; 2D discrete cosine transform; 2D type-IV DCT; DCT-IV; DWT-III; Wang mapping; computation efficiency; multidimensional signal processing; one-dimensional type-III DWT; real-valued FFT algorithm; two-dimensional discrete W transform; two-dimensional discrete cosine transform; Digital filters; Digital signal processing; Discrete cosine transforms; Discrete transforms; Discrete wavelet transforms; Process design; Signal design; Signal processing algorithms; Telecommunications; Two dimensional displays;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Proceedings, 1998. ICSP '98. 1998 Fourth International Conference on

Conference_Location

Beijing

Print_ISBN

0-7803-4325-5

Type

conf

DOI

10.1109/ICOSP.1998.770157

Filename

770157