225 search results - page 20 / 45 » The Future Fast Fourier Transform |
SSWMC
2004
13 years 9 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...
ICCD
2007
IEEE
14 years 5 months ago
2007
IEEE
This paper presents a novel transformation technique that can derive various fast Fourier transform (FFT) in a unified paradigm. The proposed algorithm is to find a common twiddle...
IAJIT
2010
13 years 5 months ago
2010
: Finite Radon Transform mapper has the ability to increase orthogonality of sub-carriers, it is non sensitive to channel parameters variations, and has a small constellation energ...
ISAAC
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...