New algorithms for multidimensional discrete Hartley transform
Signal Processing
Fast unified computation of the multi-dimensional discrete sinusoidal transforms
Applied Mathematics and Computation
| Hi-index | 35.68 |
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