187 search results - page 9 / 38 » Alternatives to the discrete fourier transform |
PACT
2009
Springer
14 years 3 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
PPL
2010
13 years 7 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A novel system, called the oscillator system, consisting of order of p 3 functions (signals) on the finite field p; with p an odd prime, is described and studied. The new functions...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this survey a novel system, called the oscillator system, consisting of order of p3 functions (signals) on the finite field Fp, is described and studied. The new functions are p...