Results 11 to 20 of about 1,798,139 (280)
Logarithm of the Discrete Fourier Transform
International Journal of Mathematics and Mathematical Sciences, 2007 The discrete Fourier transform defines a unitary matrix operator. The logarithm of this operator is computed, along with the projection maps onto its eigenspaces. A geometric interpretation of the discrete Fourier transform is also given.
Michael Aristidou, Jason Hanson
doaj +3 more sources
The discrete fractional Fourier transform [PDF]
IEEE Transactions on Signal Processing, 1999 Summary: We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier transform.
Cagatay Candan +2 more
core +13 more sources
Radar matched filtering using the fractional fourier transform [PDF]
, 2010 -A matched filter is the optimal linear filter for maximizing the signal to noise ratio (SNR) in the presence of additive noise. Matched filters are commonly used in radar systems where the transmitted signal is known and may be used as a replica to be ...
Clemente, Carmine +2 more
core +4 more sources
Trigonometric Interpolation Using the Discrete Fourier Transform [PDF]
, 2022 The Fourier transform (and all its versions, discrete/continuous/finite/infinite), covers deep and abstract mathematical concepts, and can easily overwhelm with detail.
Ponce Campuzano, Juan Carlos
core +1 more source
Error Estimates on Approximating the Finite Fourier Transform of Complex-Valued Functions via a Pre-Grüss Inequality [PDF]
, 2004 Some estimates for the error in approximating the Finite Fourier Transform in terms of exponential means via a pre-Grüss inequality for complex-valued functions are ...
Hanna, George T +2 more
core +3 more sources
Discrete fourier transform on multicore [PDF]
IEEE Signal Processing Magazine, 2009 This article gives an overview on the techniques needed to implement the discrete Fourier transform (DFT) efficiently on current multicore systems. The focus is on Intel-compatible multicores, but we also discuss the IBM Cell and, briefly, graphics processing units (GPUs).
Franz Franchetti +4 more
openaire +2 more sources
A Reverse of the Cauchy-Bunyakovsky-Schwarz Integral Inequality for Complex-Valued Functions and Applications for Fourier Transform [PDF]
, 2004 A reverse of the Cauchy-Bunyakovsky-Schwarz integral inequality for complex-valued functions and applications for the finite Fourier transform are ...
Hanna, George T +2 more
core +5 more sources
Alternatives to the discrete fourier transform [PDF]
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008 It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform (DTFT) of the same signal at equidistant points on the unit circle. Hence, as the signal length goes to infinity, the DFT approaches the DTFT.
Doru-Cristian Balcan +3 more
openaire +1 more source
Steerable Discrete Fourier Transform [PDF]
IEEE Signal Processing Letters, 2017 Directional transforms have recently raised a lot of interest thanks to their numerous applications in signal compression and analysis. In this letter, we introduce a generalization of the discrete Fourier transform, called steerable DFT (SDFT). Since the DFT is used in numerous fields, it may be of interest in a wide range of applications.
FRACASTORO, GIULIA, MAGLI, ENRICO
openaire +5 more sources
On computing the Discrete Fourier Transform [PDF]
Proceedings of the National Academy of Sciences, 1976 New algorithms for computing the Discrete Fourier Transform of n points are described. For n in the range of a few tens to a few thousands these algorithms use substantially fewer multiplications than the best algorithm previously known, and about the ...
openaire +3 more sources