DocumentCode :
1691501
Title :
Multidimensional polynomial transform algorithm for multidimensional discrete W transform
Author :
Yonghong, Zeng ; Xiaomei, Li
Author_Institution :
7th Dept., Nat. Univ. of Defence Technol., Chamgsha, China
Volume :
1
fYear :
1996
Firstpage :
123
Abstract :
As the generalisation of the multidimensional discrete Hartley transform the multidimensional discrete W transform (MDDWT) is a tool for multidimensional signal processing problems. The multidimensional polynomial transform is used to convert the MDDWT into a series of one-dimensional W transform (DWT). Thus, new polynomial transform algorithms for the MDDWT is obtained. The algorithm needs no complex number operations and is simple in structure. The number of multiplications for computing a r-d DWT is only 1/r times that of the common used row-column method. The number of additions is also reduced considerably
Keywords :
Hartley transforms; signal processing; additions; multidimensional discrete Hartley transform; multidimensional discrete W transform; multidimensional polynomial transform algorithm; multidimensional signal processing; multiplications; one-dimensional W transform; row-column method; Content addressable storage; Discrete transforms; Multidimensional systems; Polynomials; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing, 1996., 3rd International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-2912-0
Type :
conf
DOI :
10.1109/ICSIGP.1996.567052
Filename :
567052
Link To Document :
بازگشت