Related papers: Fourier transform inversion using an elementary di…
In this paper, we introduced the theory of the sieve function transformation. Using the principle of sieve function transformation, we improved sieve method, and obtained the difference range of similar sieve function values. For this, we…
We show a pointwise estimate for the Fourier transform on the line involving the number of times the function changes monotonicity. The contrapositive of the theorem may be used to find a lower bound to the number of local maxima of a…
This article proposes a new approach in the treatment of the Hilbert transform and some cases of the Fourier transform whose improper integrals are principal values. This approach may be useful for teaching these issues to undergraduate…
Alesker has proved the existence of a remarkable isomorphism of the space of translation-invariant smooth valuations that has the same functorial properties as the classical Fourier transform. In this paper, we show how to directly describe…
In this article we study the basic theoretical properties of Mellin-type fractional integrals, known as generalizations of the Hadamard-type fractional integrals. We give a new approach and version, specifying their semigroup property,…
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…
The Arithmetic Fourier Transform is a numerical formulation for computing Fourier series and Taylor series coefficients. It competes with the Fast Fourier Transform in terms of speed and efficiency, requiring only addition operations and…
Formul{\ae} are derived for expressing Cauchy and Hilbert transforms of a function $f$ in terms of Cauchy and Hilbert transforms of $f(x^r)$. When $r$ is an integer, this corresponds to evaluating the Cauchy transform of $f(x^r)$ at all…
Many tight frames of interest are constructed via their Gramian matrix (which determines the frame up to unitary equivalence). Given such a Gramian, it can be determined whether or not the tight frame is projective group frame, i.e., is the…
Recently we have reported a new method of rational approximation of the sinc function obtained by sampling and the Fourier transforms. However, this method requires a trigonometric multiplier that originates from shifting property of the…
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…
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…
This note is a very basic introduction to wavelets. It starts with an orthogonal basis of piecewise constant functions, constructed by dilation and translation. The ``wavelet transform'' maps each $f(x)$ to its coefficients with respect to…
A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…
In this paper, we introduce the fractional Fourier series on the fractional torus and study some basic facts of fractional Fourier series, such as fractional convolution and fractional approximation. Meanwhile, fractional Fourier inversion…
New sufficient conditions for representation of a function via the absolutely convergent Fourier integral are obtained in the paper. In the main result, Theorem 1.1, this is controlled by the behavior near infinity of both the function and…
The final goal of the present work is to extend the Fourier transform on the Heisenberg group $\H^d,$ to tempered distributions. As in the Euclidean setting, the strategy is to first show that the Fourier transform is an isomorphism on the…
In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant…
We propose an alternative definition for a Tsallis entropy composition-inspired Fourier transform, which we call "$\tau_q$-Fourier transform". We comment about the underlying "covariance" on the set of algebraic fields that motivates its…