Fast algorithms for the 2-D discrete W transform
Signal Processing
Fast 3-D decimation-in-frequency algorithm for 3-D Hartley transform
Signal Processing
New algorithms for multidimensional discrete Hartley transform
Signal Processing
Fast unified computation of the multi-dimensional discrete sinusoidal transforms
Applied Mathematics and Computation
Semisystolic Array Implementation of Circular, Skew Circular, and Linear Convolutions
IEEE Transactions on Computers
Radix-2 × 2 × 2 algorithm for the 3-D discrete Hartleytransform
IEEE Transactions on Signal Processing
Fast algorithm for the 3-D DCT-II
IEEE Transactions on Signal Processing
Comments on "Generalized discrete Hartley transform"
IEEE Transactions on Signal Processing
Generalized discrete Hartley transforms
IEEE Transactions on Signal Processing
A novel split-radix fast algorithm for 2-D discrete Hartley transform
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Hi-index | 0.08 |
In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comparison of the computational complexity with the familiar row-column algorithm shows that the proposed approach reduces significantly the number of arithmetic operations. Moreover, the proposed method has very regular structure, thus, it is easy to implement.