Related papers: Coefficient-of-Determination Fourier Transform
Gravitational-wave memory is characterized by a signal component that persists after a transient signal has decayed. Treating such signals in the frequency domain is non-trivial, since discrete Fourier transforms assume periodic signals on…
As a generalization of the Fourier transform, the fractional Fourier transform was introduced and has been further investigated both in theory and in applications of signal processing. We obtain a sampling theorem on shift-invariant spaces…
In this paper we propose a new version of differential transform method (we shall call this method as $\alpha$-parameterized differential transform method), which differs from the traditional differential transform method in calculating…
The nonlinear Fourier transform, which is also known as the forward scattering transform, decomposes a periodic signal into nonlinearly interacting waves. In contrast to the common Fourier transform, these waves no longer have to be…
The 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…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
We present a method for the numerical computation of Fourier-Bessel transforms on a finite or infinite interval. The function to be transformed needs to be evaluated on a grid of points that is independent of the argument of the Bessel…
This article consists of a brief discussion of the energy density over time or frequency that is obtained with the wavelet transform. Also an efficient algorithm is suggested to calculate the continuous transform with the Morlet wavelet.…
Within the expansive domain of optical sciences, achieving the precise characterization of light beams stands as a fundamental pursuit, pivotal for various applications, including telecommunications and imaging technologies. This study…
In this paper, a new variant to fractional signal processing is proposed known as the Reduced Order Fractional Fourier Transform. Various properties satisfied by its transformation kernel is derived. The properties associated with the…
We consider a version of Shor's quantum factoring algorithm such that the quantum Fourier transform is replaced by an extremely simple one where decomposition coefficients take only the values of $1,i,-1,-i$. In numerous calculations which…
The integration of Fourier transform and deep learning opens new avenues for time series forecasting. We reconsider the Fourier transform from a basis functions perspective. Specifically, the real and imaginary parts of the frequency…
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular…
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…
Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…
The Fractional Fourier Transform (FrFT) has widespread applications in areas like signal analysis, Fourier optics, diffraction theory, etc. The Holomorphic Fractional Fourier Transform (HFrFT) proposed in the present paper may be used in…
We propose an implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates. In our implementation, a data sequence is expressed by a tensor product of vector…
In deep time series forecasting, the Fourier Transform (FT) is extensively employed for frequency representation learning. However, it often struggles in capturing multi-scale, time-sensitive patterns. Although the Wavelet Transform (WT)…
This paper presents a novel frequency-domain approach for path following problem, specifically designed to handle paths described by discrete data. The proposed algorithm utilizes the fast Fourier Transform (FFT) to process the discrete…
Phase-space analysis or time-frequency analysis can be thought as Fourier analysis simultaneously both in time and in frequency, originating from signal processing and quantum mechanics. On groups having unitary Fourier transform, we…