Related papers: Towards Quaternion Quadratic Phase Fourier Transfo…
The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…
The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
Fourier and fractional-Fourier transformations are widely used in theoretical physics. In this paper we make quantum perspectives and generalization for the fractional Fourier transformation (FrFT). By virtue of quantum mechanical…
Gabor transform is one of the performed tools for time-frequency signal analysis. The principal aim of this paper is to generalize the Gabor Fourier transform to the quaternion linear canonical transform. Actually, this transform gives us…
Multivariate time series forecasting is a pivotal task in several domains, including financial planning, medical diagnostics, and climate science. This paper presents the Neural Fourier Transform (NFT) algorithm, which combines…
Fractional programming (FP) is a branch of mathematical optimization that deals with the optimization of ratios. It is an invaluable tool for signal processing and machine learning, because many key metrics in these fields are fractionally…
Quantum signal processing (QSP) provides a representation of scalar polynomials of degree $d$ as products of matrices in $\mathrm{SU}(2)$, parameterized by $(d+1)$ real numbers known as phase factors. QSP is the mathematical foundation of…
In this research paper, our primary focus revolves around the domain-specific hardware mapping strategy tailored for Quantum Fourier Transformation (QFT) circuits. While previous approaches have heavily relied on SAT solvers or heuristic…
Quantum signal processing (QSP) and quantum singular value transformation (QSVT) are powerful techniques for the development of quantum procedures. They allow to derive circuits preparing desired polynomial transformations. Recent research…
Algorithms for processing data in short-time batches are critical for both online and offline processing of streamed and large data respectively due to the quadratic relation between signal length and computational cost of convolution-based…
In this work, a quaternion-valued model is proposed in lieu of the Clarke's \alpha, \beta transformation to convert three-phase quantities to a hypercomplex single-phase signal. The concatenated signal can be used for harmonic distortion…
In this paper, we introduce the notion of quaternion shearlet transform- which is an extension of the ordinary shearlet transform. Firstly, we study the fundamental properties of quaternion shearlet transforms and then establish some basic…
The Special Affine Fourier Transform or the SAFT generalizes a number of well known unitary transformations as well as signal processing and optics related mathematical operations. Unlike the Fourier transform, the SAFT does not work well…
In this paper, we prove both of the Titchmarsh theorems associated with Two-Sided Quaternionic Fourier Transform and we conclude about Short-Time Two-Sided Quaternionic Fourier Transform.
The fractional Fourier transform (FrFT), a fundamental operation in physics that corresponds to a rotation of phase space by any angle, is also an indispensable tool employed in digital signal processing for noise reduction. Processing of…
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…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
With the race to build large-scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of…
We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…