Sciweavers

160 search results - page 9 / 32
» On the diagonalization of the discrete Fourier transform
Sort
View
ICIP
2010
IEEE
13 years 4 months ago
Spiral FFT: An efficient method for 3-D FFTS on spiral MRI contours
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...
Christopher K. Turnes, Justin K. Romberg
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
The finite harmonic oscillator and its applications to sequences, communication and radar
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...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Group representation design of digital signals and sequences
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...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
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
ICS
2009
Tsinghua U.
14 years 2 months ago
Computer generation of fast fourier transforms for the cell broadband engine
The Cell BE is a multicore processor with eight vector accelerators (called SPEs) that implement explicit cache management through direct memory access engines. While the Cell has...
Srinivas Chellappa, Franz Franchetti, Markus P&uum...