Related papers: Circular Convolution and Product Theorem for Affin…
Recently the construction of various integral transforms for slice monogenic functions has gained a lot of attention. In line with these developments, the article at hand introduces the slice Fourier transform. In the first part, the kernel…
An experiment to demonstrate the Fourier transform of an electric signal using the Kundt's tube is described. The results of finding the component frequencies and an approximation to the amplitudes of two sinusoidal signals which compose an…
In this paper, a Fourier series in fractional dimensional space is introduced for an arbitrarily periodic function $f(t;\alpha)$. We call it fractional Fourier series of the order $\alpha$. Extending the basis functions of the linear space…
We introduce a fully convolutional fractional scaling component, FCFS. Fully convolutional networks can be applied to any size input and previously did not support non-integer scaling. Our architecture is simple with an efficient single…
This paper develops a constructive numerical scheme for Fourier-Bessel approximations on disks compatible with convolutions supported on disks. We address accurate finite Fourier-Bessel transforms (FFBT) and inverse finite Fourier-Bessel…
For each $f\!:\!\mathbb{R}\to\mathbb{C}$ that is Henstock--Kurzweil integrable on the real line, or is a distribution in the completion of the space of Henstock--Kurzweil integrable functions in the Alexiewicz norm, it is shown that the…
One of the key challenges in the area of signal processing on graphs is to design dictionaries and transform methods to identify and exploit structure in signals on weighted graphs. To do so, we need to account for the intrinsic geometric…
A many to one discrete auditory transform is presented to map a sound signal to a perceptually meaningful spectrum on the scale of human auditory filter band widths (critical bands). A generalized inverse is constructed in closed analytical…
Fractional equations have become the model of choice in several applications where heterogeneities at the microstructure result in anomalous diffusive behavior at the macroscale. In this work we introduce a new fractional operator…
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…
Ongoing work in quantum information emphasises the need for a structural understanding of quantum speedups: in this work, we focus on the quantum Fourier transform and the structures in quantum theory that enable it. We elucidate a general…
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…
This summary of the doctoral thesis provides a comprehensive formulation of the Extended Discrete Fourier Transform (EDFT), derived directly from the Fourier integral and its orthogonality properties. The method is obtained by solving…
The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…
In the present article the author extends the Fourier transform to a more general class of functions; First to power-law functions with integer and half-integer exponents then to the widely used quantum statistics function (Fermi-Dirac and…
The inversion theorem and convolution theorem of the conformable fractional Laplace transforms are developed. All the elementary properties of the classical Laplace transform are extended to the conformable fractional transform, and using…
Positive time varying frequency representation for transient signals has been a hearty desire of signal analysts due to its theoretical and practical importance. During approximately the last two decades there has formulated a signal…
Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…
In the digital world, signals are discrete and finite. The Fourier representation of discrete and finite signals is FT convolution of the finite sampling function and the continuous signal. Conventionally, finite sampling is treated as a…
We provide a rigorous convergence proof demonstrating that the well-known semi-analytical Fourier cosine (COS) formula for the inverse Fourier transform of continuous probability distributions can be extended to discrete probability…