Results 1  10
of
16,923
On the Use of Windows for Harmonic Analysis With the Discrete Fourier Transform
 Proc. IEEE
, 1978
"... AhmwThis Pw!r mak = available a concise review of data win compromise consists of applying windows to the sampled daws pad the ^ affect On the Of in the data set, or equivalently, smoothing the spectral samples. '7 of aoise9 m the ptesence of sdroag bar The two operations to which we subject ..."
Abstract

Cited by 668 (0 self)
 Add to MetaCart
subject the data are momc mterference. We dm call attention to a number of common = in be rp~crh of windows den used with the fd F ~ sampling and windowing. These operations can be performed transform. This paper includes a comprehensive catdog of data win in either order. Sampling is well understood
Fourier Transform
, 2010
"... Abstract: In this paper, a new tool that is fractional Fourier Transform is introduced to 3D model retrieval. And we propose a 3D model descriptor based on 3D factional Fourier transform. Fractional Fourier transform is a general format of Fourier transform, and add a variables that is order. Our ap ..."
Abstract
 Add to MetaCart
Abstract: In this paper, a new tool that is fractional Fourier Transform is introduced to 3D model retrieval. And we propose a 3D model descriptor based on 3D factional Fourier transform. Fractional Fourier transform is a general format of Fourier transform, and add a variables that is order. Our
Fourier Transform
, 2010
"... Abstract. We consider the problem of quickly estimating the best kterm Fourier representation for a given frequencysparse bandlimited signal (i.e., function) f: [0,2π] → C. In essence, this requires the identification of k of the largest magnitude frequencies of ˆf ∈ C N, and the estimation thei ..."
Abstract
 Add to MetaCart
their Fourier coefficients. Randomized sublineartime Monte Carlo algorithms, which have a small probability of failing to output accurate answers for each input signal, have been developed for solving this problem [1, 2]. These methods were implemented as the Ann Arbor Fast Fourier Transform (AAFFT
FOURIER TRANSFORM
"... a generalization of the classical Fourier Transform, which has found its most useful applications for the transient analysis of the signals. This paper studies the span of the Fractional Fourier Transform in relation with the amplitude and phase functions of the signal and provides a mathematical de ..."
Abstract
 Add to MetaCart
a generalization of the classical Fourier Transform, which has found its most useful applications for the transient analysis of the signals. This paper studies the span of the Fractional Fourier Transform in relation with the amplitude and phase functions of the signal and provides a mathematical
Fourier Transform:
, 2013
"... e 2πixξ f (x)dx, ξ ∈ R. Optimizer’s curse of dimensionality: An optimization problem whose variables are a function f (x), x ∈ R, and whose constraints are given on the Fourier transform is an ∞ × ∞dimensional problem. Some “tricks ” are used to address this curse. A first step is to assume (as is ..."
Abstract
 Add to MetaCart
e 2πixξ f (x)dx, ξ ∈ R. Optimizer’s curse of dimensionality: An optimization problem whose variables are a function f (x), x ∈ R, and whose constraints are given on the Fourier transform is an ∞ × ∞dimensional problem. Some “tricks ” are used to address this curse. A first step is to assume (as
Introduction to Fourier Transforms1
"... The proof of all the standard Fourier transformations: Discrete Fourier Transform, Fourier Series, DiscreteTime Fourier Transform and Fourier Transform is presented here ..."
Abstract
 Add to MetaCart
The proof of all the standard Fourier transformations: Discrete Fourier Transform, Fourier Series, DiscreteTime Fourier Transform and Fourier Transform is presented here
LENSLESS FOURIER TRANSFORM HOLOGRAPHY
, 1980
"... Image deblurring using lensless Fourier transform holography ..."
The Fractional Fourier Transform and Applications
, 1995
"... This paper describes the "fractional Fourier transform", which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e \Gamma2ßi=n , the fractional Four ..."
Abstract

Cited by 68 (2 self)
 Add to MetaCart
This paper describes the "fractional Fourier transform", which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e \Gamma2ßi=n , the fractional
Results 1  10
of
16,923