相关论文: Fast complexified quaternion Fourier transform
Quaternion-valued signals along with quaternion Fourier transforms (QFT)provide an effective framework for vector-valued signal and image processing. However, the sampling theory of quaternion valued signals has not been well developed. In…
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a…
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…
This article investigates Kak neural networks, which can be instantaneously trained, for complex and quaternion inputs. The performance of the basic algorithm has been analyzed and shown how it provides a plausible model of human perception…
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…
For a sample set of 1024 values, the FFT is 102.4 times faster than the discrete Fourier transform (DFT). The basis for this remarkable speed advantage is the `bit-reversal' scheme of the Cooley-Tukey algorithm. Eliminating the burden of…
In this paper, we extend the coupled fractional Fourier transform of a complex valued functions to that of the quaternion valued functions on $\mathbb{R}^4$ and call it the quaternion coupled fractional Fourier transform (QCFrFT). We obtain…
In this paper, we extend the quadratic phase Fourier transform of a complex valued functions to that of the quaternion valued functions of two variables. We call it the quaternion quadratic phase Fourier transform (QQPFT). Based on the…
The explicit construction of direct and inverse Fourier's vector transform with discontinuous coefficients is presented. The technique of applying Fourier's vector transform with discontinuous coefficients for solving problems of…
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…
This paper examines the existence and region of convergence of Fourier transform of the functions of bicomplex variables with the help of projection on its idempotent components as auxiliary complex planes. Several basic properties of this…
The article contents suggestions on how to perform the Fast Fourier Transform over Large Finite Fields. The technique is to use the fact that the multiplicative groups of specific prime fields are surprisingly composite.
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
Recently, there has been an increasing interest in the study of hypercomplex signals and their Fourier transforms. This paper aims to study such integral transforms from general principles, using 4 different yet equivalent definitions of…
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…
We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$…
The ideas of instantaneous amplitude and phase are well understood for signals with real-valued samples, based on the analytic signal which is a complex signal with one-sided Fourier transform. We extend these ideas to signals with…
We present the detailed process of converting the classical Fourier Transform algorithm into the quantum one by using QR decomposition. This provides an example of a technique for building quantum algorithms using classical ones. The…
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…
Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the…