Results 1 to 10 of about 2,667,749 (348)
Different computational approach for Fourier transforms by using variational iteration method
In this paper, we present another method for computing Fourier transforms of functions considering the Variational Iteration Method (VIM). Through our procedure, the Fourier transforms of functions can be calculated precisely and without reference to ...
Murat Düz, Ahmad Issa
doaj +1 more source
Nonlinearizad of Fast Fourier Transform
A unified mathematical form of reversible nonlinear transformations based on a nonlinear tensor product is presented in the form of fast algorithms.
Valeriy Labunets +2 more
doaj +1 more source
Fourier restriction to polynomial curves I: a geometric inequality [PDF]
We prove a Fourier restriction result for general polynomial curves in Rd. Measuring the Fourier restriction with respect to the affine arclength measure of the curve, we obtain a universal estimate for the class of all polynomial curves of bounded ...
Wright, James +5 more
core +1 more source
We consider the problem of computing the Fourier transform of high-dimensional vectors, distributedly over a cluster of machines consisting of a master node and multiple worker nodes, where the worker nodes can only store and process a fraction of the inputs.
Qian Yu 0001 +2 more
openaire +2 more sources
Radar matched filtering using the fractional fourier transform [PDF]
-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 +5 more
core +1 more source
On the Fractional Derivative Duality in Some Transforms
Duality is one of the most interesting properties of the Laplace and Fourier transforms associated with the integer-order derivative. Here, we will generalize it for fractional derivatives and extend the results to the Mellin, Z and discrete-time Fourier
Manuel Duarte Ortigueira +1 more
doaj +1 more source
Transformer architectures show spectacular performance on NLP tasks and have recently also been used for tasks such as image completion or image classification. Here we propose to use a sequential image representation, where each prefix of the complete sequence describes the whole image at reduced resolution. Using such Fourier Domain Encodings (FDEs),
Tim-Oliver Buchholz, Florian Jug
openaire +2 more sources
The Design of Low Complexity Low Power Pipelined Short Length Winograd Fourier Transforms [PDF]
In this paper a novel pipelining approach applicable to Winograd Fourier transforms is presented. The novel approach makes use of reconfigurable multiplier blocks to implement the real multipliers required for the transform as well as sharing the ...
Stephen Brown +11 more
core +1 more source
Fourier transforms of Dini-Lipschitz functions
It is well known that if Lipschitz conditions of a certain order are imposed on a function f(x), then these conditions affect considerably the absolute convergence of the Fourier series and Fourier transforms of f.
M. S. Younis
doaj +1 more source

