242 search results - page 2 / 49 » Optimized Fast Algorithms for the Quaternionic Fourier Trans... |
ICMCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform....
TIFS
2008
13 years 5 months ago
2008
This paper presents two vector watermarking schemes that are based on the use of complex and quaternion Fourier transforms and demonstrates, for the first time, how to embed waterm...
APCCAS
2006
IEEE
13 years 7 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
CPHYSICS
2010
13 years 5 months ago
2010
We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical...