Fast algorithms of multidimensional discrete nonseparable /spl Kscr/-wave transforms
E. Rundblad, Valery Labunets, Jaakko T. Astola, Karen Egiazarian · IEEE Transactions on Signal Processing · 2002
Fast algorithms for a wide class of nonseparable n-dimensional (n-D) discrete unitary /spl Kscr/ transforms (DKTs) are introduced. They need fewer 1-D DKTs than in the case of the classical radix-2 FFT-type approach. The method utilizes a decomposition of the n-D K transform into the product of a new n-D discrete Radon transform and of a set of parallel/independ 1-D K transforms. If the n-D K transform has a separable kernel (e.g., the case of the discrete Fourier transform), our approach leads to decrease of multiplicative complexity by the factor of n, compared with the classical row/column separable approach.