Related papers: On semifast Fourier transform algorithms
Real life signals are in general non--stationary and non--linear. The development of methods able to extract their hidden features in a fast and reliable way is of high importance in many research fields. In this work we tackle the problem…
The Fourier transform is typically seen as closely related to the additive group of real numbers, its characters and its Haar measure. In this paper, we propose an alternative viewpoint; the Fourier transform can be uniquely characterized…
Quantum Fourier transformation is important in many quantum algorithms. In this paper, we generalize quantum Fourier transformation over the Abelian group $\mathbb{Z}_N$ from two different points to get more efficient unitary…
Fourier sine transforms containing irrational integrands are presented. Explicit closed form expressions are shown to be related to Lommel functions and in special cases to the Fresnel integrals. Such integrals arise in the semi-classical…
Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense…
We treat the quaternionic Fourier transform (QFT) applied to quaternion fields and investigate QFT properties useful for applications. Different forms of the QFT lead us to different Plancherel theorems. We relate the QFT computation for…
We develop number theoretic tools that allow to perform computations relevant for the quantum mechanics over finite fields of arbitrary, odd size, with the same speedup that is enjoyed by the Fast Fourier Transform.
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…
Machine learning algorithms learn a desired input-output relation from examples in order to interpret new inputs. This is important for tasks such as image and speech recognition or strategy optimisation, with growing applications in the IT…
Several notions of "analytic" functor introduced recently in the literature fit into the graphic fourier transform context presented in [D].
Various applications such as MRI, solution of PDEs, etc. need to perform an inverse nonequispaced fast Fourier transform (NFFT), i. e., compute $M$ Fourier coefficients from given $N$ nonequispaced data. In the present paper we consider…
We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k << N significant Fourier coefficients from a signal of bandwidth N. Previous deterministic algorithms exhibit quadratic…
Partial Fourier transforms are used to find explicit formulas for two remarkable fundamental solutions for a generalized Tricomi operator. These fundamental solutions reflect clearly the mixed type of the operator. In order to prove these…
Factorization machines (FMs) are a supervised learning approach that can use second-order feature combinations even when the data is very high-dimensional. Unfortunately, despite increasing interest in FMs, there exists to date no efficient…
The concept of the quantum Pfaffian is rigorously examined and refurbished using the new method of quantum exterior algebras. We derive a complete family of Pl\"ucker relations for the quantum linear transformations, and then use them to…
Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a…
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…
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 nonlinear Fourier transform (NLFT) extends the classical Fourier transform by replacing addition with matrix multiplication. While the NLFT on $\mathrm{SU}(1,1)$ has been widely studied, its $\mathrm{SU}(2)$ variant has only recently…
Some elaborations regarding the Hilbert and Fourier transforms of Fermi function are presented. The main result shows that the Hilbert transform of the difference of two Fermi functions has an analytical expression in terms of the $\Psi$…