481 search results - page 19 / 97 » A Fast Program Generator of Fast Fourier Transforms |
FOCS
1989
IEEE
15 years 1 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
83
Voted
SSWMC
2004
14 years 11 months ago
2004
This work reduces the computational requirements of the additive noise steganalysis presented by Harmsen and Pearlman. The additive noise model assumes that the stegoimage is crea...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and it...
98
Voted
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Short vector SIMD instructions on recent microprocessors, such as SSE on Pentium III and 4, speed up code but are a major challenge to software developers. We present a compiler t...
71
Voted
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...