Results 31 to 40 of about 242,792 (179)
Doppler Spectrum Estimation by Ramanujan Fourier Transforms [PDF]
, 2009 The Doppler spectrum estimation of a weather radar signal in a classic way can be made by two methods, temporal one based in the autocorrelation of the successful signals, whereas the other one uses the estimation of the power spectral density PSD by ...
Bensebti, Messaoud, Lagha, Mohand
core +4 more sources
Fourier Transforms of Finite Chirps
EURASIP Journal on Advances in Signal Processing, 2006 Chirps arise in many signal processing applications. While chirps have been extensively studied as functions over both the real line and the integers, less attention has been paid to the study of chirps over finite groups.
Fickus Matthew, Casazza Peter G
doaj +1 more source
Fast Computation of Singular Oscillatory Fourier Transforms
Abstract and Applied Analysis, 2014 We consider the problem of the numerical evaluation of singular oscillatory Fourier transforms ∫abx-aαb-xβf(x)eiωxdx, where α>-1 and β>-1. Based on substituting the original interval of integration by the paths of steepest descent, if f is analytic ...
Hongchao Kang, Xinping Shao
doaj +1 more source
Steerable Discrete Fourier Transform
, 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).
Fracastoro, Giulia, Magli, Enrico
core +1 more source
Fourier-Mukai transforms [PDF]
, 2007 Suggestions by many people incorporated (see the acknowledgement at the end of the introduction)
Hille, Lutz, Bergh, Michel Van den
openaire +2 more sources
Efficient Algorithm for Finding Roots of Error-Locator Polynomials
IEEE Access, 2021 A novel method for finding roots of polynomials over finite fields has been proposed. This method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is achieved by using the normalized cyclic convolutions, which have a small
Sergei Valentinovich Fedorenko
doaj +1 more source
Multi-dimensional real Fourier transform [PDF]
, 1971 Four subroutines compute one-dimensional and multi-dimensional Fourier transforms for real data, multi-dimensional complex Fourier transforms, and multi-dimensional sine, cosine and sine-cosine transforms.
Krogh, F. T.
core +1 more source
Fourier and Beyond: Invariance Properties of a Family of Integral Transforms
, 2016 The Fourier transform is typically seen as closely related to the additive group of real numbers, its characters and its Haar measure. In this paper, we propose an alternative viewpoint; the Fourier transform can be uniquely characterized by an ...
Bodmann, Bernhard G. +2 more
core +1 more source
Novel Fourier quadrature transforms and analytic signal representations for nonlinear and non-stationary time-series analysis [PDF]
Royal Society Open Science, 2018 The Hilbert transform (HT) and associated Gabor analytic signal (GAS) representation are well known and widely used mathematical formulations for modelling and analysis of signals in various applications.
Pushpendra Singh
doaj +1 more source
Quantum Fourier transform revisited
Numerical Linear Algebra with Applications, 2020 SummaryThe fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix.
Daan Camps, Roel Van Beeumen, Chao Yang
openaire +6 more sources