相关论文: Fast complexified quaternion Fourier transform

Calculations of the Fourier transform of a constant quantity over an area or volume defined by polygons (connected vertices) are often useful in modeling wave scattering, or in fourier-space filtering of real-space vector-based volumes and…

In this study, we introduce the concept of commutative quaternions and commutative quaternion matrices. Firstly, we give some properties of commutative quaternions and their Hamilton matrices. After that we investigate commutative…

Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…

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…

Fourier transform is applied to annular beams of simplified flat two-level geometry: bright outer ring with a darker core. The pattern of focal beam profile (i.e. far field) is calculated and characterized with respect of its intensity…

In this paper, we mainly establish the uncertainty principle (UP) for a function and its quaternion Fractional Fourier transform (QFrFT), as well as the UP for two QFrFTs. Using the polar representation of quaternion-valued signals, we give…

In recent years there has been a growing interest in the fractional Fourier transform driven by its large number of applications. The literature in this field follows two main routes. On the one hand, the areas where the ordinary Fourier…

In this paper, we offer and discuss three efficient structural solutions for the hardware-oriented implementation of discrete quaternion Fourier transform basic operations with reduced implementation complexities. The first solution: a…

The quaternion Fourier transform (QFT) satisfies some uncertainty principles similar to the Euclidean Fourier transform. In this paper, we establish Miyachi's theorem for this transform.

The fundamental properties of biquaternions (complexified quaternions) are presented including several different representations, some of them new, and definitions of fundamental operations such as the scalar and vector parts, conjugates,…

We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…

We prove the Plancherel formula for a four-parameter family of discrete Fourier transforms and their multivariate generalizations stemming from corresponding generalized Schur polynomials. For special choices of the parameters, this…

The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…

In this paper, a fractional version of the Clifford-Fourier transform is introduced, depending on two numerical parameters. A series expansion for the kernel of the resulting integral transform is derived. In the case of even dimension,…

The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two…

Deep Learning-based Computer Vision field has recently been trying to explore larger kernels for convolution to effectively scale up Convolutional Neural Networks. Simultaneously, new paradigm of models such as Vision Transformers find it…

Quaternion models have been developed for both direction of arrival estimation and beamforming based on crossed-dipole arrays in the past. However, for almost all the models, especially for adaptive beamforming, the desired signal is still…

The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…

For a real sequence of length of m = nl, we may deduce its congruence derivative sequence with length of l. The discrete Fourier transform of original sequence can be calculated by the discrete Fourier transform of the congruence derivative…

The quadratic phase Fourier transform (QPFT) is a generalization of several well-known integral transforms, including the linear canonical transform (LCT), fractional Fourier transform (FrFT), and Fourier transform (FT). This paper…