相关论文: Fast complexified quaternion Fourier transform
This paper presents a new approach in application of the Fourier transform to the complex error function resulting in an efficient rational approximation. Specifically, the computational test shows that with only $17$ summation terms the…
Fourier representations play a central role in operator learning methods for partial differential equations and are increasingly being explored in quantum machine learning architectures. The classical fast Fourier transform (FFT),…
We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is…
We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…
The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.
The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the…
An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the…
The linear canonical wavelet transform has been shown to be a valuable and powerful time-frequency analyzing tool for optics and signal processing. In this article, we propose a novel transform called quaternion linear canonical wavelet…
In the field of applied mathematics the Fourier transform has developed into an important tool. It is a powerful method for solving partial differential equations. The Fourier transform provides also a technique for signal analysis where…
We generalize quaternion and Clifford Fourier transforms to general two-sided Clifford Fourier transforms (CFT), and study their properties (from linearity to convolution). Two general \textit{multivector square roots} $\in \cl{p,q}$…
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…
A low-complexity 8-point orthogonal approximate DCT is introduced. The proposed transform requires no multiplications or bit-shift operations. The derived fast algorithm requires only 14 additions, less than any existing DCT approximation.…
We provide an introduction to the Fractional Fourier Transform $\mathcal{F}_{\theta}$ and draw a connection between it and the unit complex number $e^{i\theta}$. Motivated by this, we define an entirely new object associated with any unit…
This paper details the purpose, difficulties, theory, implementation, and results of developing a Fast Fourier Transform (FFT) using the prime factor algorithm on an embedded system. Many applications analyze the frequency content of…
Functions of several quaternion variables are investigated and integral representation theorems for them are proved. With the help of them solutions of the $\tilde \partial $-equations are studied. Moreover, quaternion Stein manifolds are…
Both of Wavelet and Fast Fourier Transform are strong signal processing tools in the field of Data Analysis. In this paper fast fourier transform (FFT) and Wavelet Transform are employed to observe some important features of Solar image…
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
In this work, we present the \emph{twiddless fast Fourier transform (TFFT)}, a novel algorithm for computing the $N$-point discrete Fourier transform (DFT). The TFFT's divide strategy builds on recent results that decimate an $N$-point…
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of…
We find a formula that relates the Fourier transform of a radial function on $\mathbf{R}^n$ with the Fourier transform of the same function defined on $\mathbf{R}^{n+2}$. This formula enables one to explicitly calculate the Fourier…