Related papers: Fourier Series and Transforms via Convolution
This paper proposes convolutional filtering for data whose structure can be modeled by a simplicial complex (SC). SCs are mathematical tools that not only capture pairwise relationships as graphs but account also for higher-order network…
We review the Fourier-Laguerre transform, an alternative harmonic analysis on the three-dimensional ball to the usual Fourier-Bessel transform. The Fourier-Laguerre transform exhibits an exact quadrature rule and thus leads to a sampling…
The analysis of signals created by a variety of instruments involves calculating the phase of a sinusoidal type signal. One widely used method to extract this information is through the use of Fourier transforms, but it is known that…
In this short note, we treat an unbalanced shifted convolution sum of Fourier coefficients of cusp forms by a rather simple argument. Our result improves previous results established by more advanced approaches.
It is known that the unified transform method may be used to solve any well-posed initial-boundary value problem for a linear constant-coefficient evolution equation on the finite interval or the half-line. In contrast, classical methods…
The windowed quadratic phase Fourier transform (WQPFT) combines the localization capabilities of windowed transforms with the phase modulation structure of the quadratic phase Fourier transform (QPFT). This paper investigates fundamental…
A rapid transformation is derived between spherical harmonic expansions and their analogues in a bivariate Fourier series. The change of basis is described in two steps: firstly, expansions in normalized associated Legendre functions of all…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the third paper, the analytical analysis of multiscale phenomena inherent in the…
In this paper, we will extend the falling and rising factorial transforms \cite{ref. 1} which in this case every arbitrary function can be applied. Then, the properties of these transforms will be investigated and some corollaries will be…
In this note we construct a quantum Fourier transform circuit in a recursive way, by directly copying the 'divide and conquer' construction of the fast Fourier transform algorithm, rather than using the explicit formula that is given in…
This tutorial is designed to clarify a few misconceptions in the field of ultrafast optics. (1) Analytic signal that underlies the complex-conjugate decomposition of the field is discussed, as well as the misunderstanding between…
In this work we define a Fourier transform for each $f\in L^{p(\cdot)}(\mathbb{R})$, for a large class of exponent functions $p(\cdot)$, as the distributional derivative of a H\"older continuous function. A norm is defined in the space of…
In this paper we examine the existence of bicomplexified inverse Fourier transform as an extension of its complexified inverse version within the region of convergence of bicomplex Fourier transform. In this paper we use the idempotent…
The quadratic phase Fourier transform QPFT is a neoteric addition to the class of Fourier transforms and embodies a variety of signal processing tools including the Fourier, fractional Fourier, linear canonical, and special affine Fourier…
The Fourier transform of a bounded measurable function, $f$, on the real line is shown to be the second distributional derivative of a H\"older continuous function. The Fourier transform is written as the difference of $\int_{-1}^1…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
We calculate the Fourier transform of a spherically symmetric exponential function. Our evaluation is much simpler than the known one. We use the polar coordinates and reduce the Fourier transform to the integral of a rational function of…
In many network problems, graphs may change by the addition of nodes, or the same problem may need to be solved in multiple similar graphs. This generates inefficiency, as analyses and systems that are not transferable have to be…
Despite their simple intuition, convolutions are more tedious to analyze than dense layers, which complicates the transfer of theoretical and algorithmic ideas to convolutions. We simplify convolutions by viewing them as tensor networks…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. The second paper is concerned with simultaneous approximation to functions and their…