481 search results - page 11 / 97 » A Fast Program Generator of Fast Fourier Transforms |
106
click to vote
CANS
2011
Springer
13 years 9 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
81
Voted
IPPS
2002
IEEE
15 years 2 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....
94
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform of the same signal at equidistant p...
EGH
2003
Springer
15 years 2 months ago
2003
Springer
The Fourier transform is a well known and widely used tool in many scientific and engineering fields. The Fourier transform is essential for many image processing techniques, in...