DocumentCode :
1521952
Title :
Multidimensional polynomial transform algorithm for multidimensional discrete W transform
Author :
Zeng, Yonghong ; Li, Xiaomei
Author_Institution :
Nat. Univ. of Defense Technol., Changsha, China
Volume :
47
Issue :
7
fYear :
1999
fDate :
7/1/1999 12:00:00 AM
Firstpage :
2050
Lastpage :
2053
Abstract :
The multidimensional (MD) polynomial transform is used to convert the MD W transform (MDDWT) into a series of one-dimensional (1-D) W transforms (DWTs). Thus, a new polynomial transform algorithm for the MDDWT is obtained. The algorithm needs no operations on complex data. The number of multiplications for computing an r-dimensional DWT is only 1 times that of the commonly used row-column method. The number of additions is also reduced considerably
Keywords :
discrete transforms; multidimensional signal processing; polynomials; MDDWT; additions number; multidimensional discrete W transform; multidimensional polynomial transform algorithm; one-dimensional W transforms; polynomial transform algorithm; r-dimensional DWT; Computational complexity; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Discrete wavelet transforms; HDTV; Kernel; Multidimensional systems; Polynomials; Signal processing algorithms;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/78.771054
Filename :
771054
Link To Document :
بازگشت