Related papers: Uncertainty Principle for the Clifford Geometric A…
The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to…
In this paper we study the scale-space classification of signals via the maximal set of kernels. We use a geometric approach which arises naturally when we consider parameter variations in scale-space. We derive the Fourier transform…
This paper presents an algebraic theory of linear signal processing. At the core of algebraic signal processing is the concept of a linear signal model defined as a triple (A, M, phi), where familiar concepts like the filter space and the…
The windowed quadratic phase Fourier transform (WQPFT) combines the localization capabilities of windowed transforms with the phase modulation structure of the quadratic phase Fourier transform (QPFT). This paper investigates fundamental…
We define a novel time-frequency analyzing tool, namely linear canonical wavelet transform (LCWT) and study some of its important properties like inner product relation, reconstruction formula and also characterize its range. We obtain…
Vertex-frequency analysis, particularly the windowed graph Fourier transform (WGFT), is a significant challenge in graph signal processing. Tight frame theories is known for its low computational complexity in signal reconstruction, while…
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)…
Is there more to Dirac's gamma matrices than meets the eye? It turns out that gamma zero can be factorized into a product of three operators. This revelation facilitates the expansion of Dirac's space-time algebra to Clifford algebra…
A new definition of a fractional derivative has recently been developed, making use of a fractional Dirac delta function as its integral kernel. This derivative allows for the definition of a distributional fractional derivative, and as…
Clifford algebras are naturally associated with quadratic forms. These algebras are Z_2-graded by construction. However, only a Z_n-gradation induced by a choice of a basis, or even better, by a Chevalley vector space isomorphism Cl(V) <->…
The famous Fourier theorem states that, under some restrictions, any periodic function (or real world signal) can be obtained as a sum of sinusoids, and hence, a technique exists for decomposing a signal into its sinusoidal components. From…
For each quadratic form Q in Quad(V) over a given vector space over a field R we have the Clifford algebra Cl(V,Q) defined as the quotient T(V)/I(Q) of the tensor algebra T(V) over the two-sided ideal generated by expressions of the form $x…
- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has…
VQC can be understood through the lens of Fourier analysis. It is already well-known that the function space represented by any circuit architecture can be described through a truncated Fourier sum. We show that the spectrum available to…
Geometric algebra was initiated by W.K. Clifford over 130 years ago. It unifies all branches of physics, and has found rich applications in robotics, signal processing, ray tracing, virtual reality, computer vision, vector field processing,…
The aim of this paper is to establish a few uncertainty principles for the Fourier and the short-time Fourier transforms. Also, we discuss an analogue of Donoho--Stark uncertainty principle and provide some estimates for the size of the…
Classical results due to Ingham and Paley-Wiener characterize the existence of nonzero functions supported on certain subsets of the real line in terms of the pointwise decay of the Fourier transforms. We view these results as uncertainty…
We introduce the Fourier Learning Machine (FLM), a neural network (NN) architecture designed to represent a multidimensional nonharmonic Fourier series. The FLM uses a simple feedforward structure with cosine activation functions to learn…
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…
This paper introduces a generalised 3rd-order Spectral Representation Method for the simulation of multi-dimensional stochastic fields with asymmetric non-linearities. The simulated random fields satisfy a prescribed Power Spectrum and…