Sciweavers

225 search results - page 7 / 45
» The Future Fast Fourier Transform
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Alternatives to the discrete fourier transform
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...
Doru-Cristian Balcan, Aliaksei Sandryhaila, Jonath...
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
14 years 1 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven
RAS
2006
105views more  RAS 2006»
13 years 8 months ago
Efficient visual homing based on Fourier transformed panoramic images
We present a fast and efficient homing algorithm based on Fourier transformed panoramic images. By continuously comparing Fourier coefficients calculated from the current view wit...
Wolfgang Stürzl, Hanspeter A. Mallot
FP
1989
124views Formal Methods» more  FP 1989»
14 years 14 days ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
VMV
2004
208views Visualization» more  VMV 2004»
13 years 9 months ago
Fourier Volume Rendering on the GPU Using a Split-Stream-FFT
The Fourier volume rendering technique operates in the frequency domain and creates line integral projections of a 3D scalar field. These projections can be efficiently generated ...
Thomas Jansen, Bartosz von Rymon-Lipinski, Nils Ha...