Sciweavers

245 search results - page 8 / 49
» A Fast Fourier Transform Compiler
Sort
View
IAJIT
2010
107views more  IAJIT 2010»
13 years 6 months ago
Low Latency, High Throughput, and Less Complex VLSI Architecture for 2D-DFT
: This paper proposes a pipelined, systolic architecture for two- dimensional discrete Fourier transform computation which is highly concurrent. The architecture consists of two, o...
Sohil Shah, Preethi Venkatesan, Deepa Sundar, Muni...
RAS
2006
105views more  RAS 2006»
13 years 7 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»
13 years 11 months 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 8 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...
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 7 months ago
The discrete Fourier transform: A canonical basis of eigenfunctions
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 ...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen