Related papers: What is the JEFT?
This paper conducts a geometric analysis of the Joint-Eigenspace Fourier transform of the symmetric space of the non-compact type. Our study shows how the Poisson transform builds up the well-known Helgason Fourier transform for an analysis…
Graph signal processing (GSP) facilitates the analysis of high-dimensional data on non-Euclidean domains by utilizing graph signals defined on graph vertices. In addition to static data, each vertex can provide continuous time-series…
We consider the irreducibility of the regular representation of a noncompact semisimpe Lie group $G$ on the Hilbert space of the image of the Joint-Eigenspace Fourier transform on its corresponding symmetric space $G/K.$ The…
The non-equidistant fast Fourier transform (NFFT) is an extension of the famous fast Fourier transform (FFT), which can be applied to non-equidistantly sampled data in time/space or frequency domain. It is an approximative algorithm that…
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…
Density-functional theory (DFT) has revolutionized computational prediction of atomic-scale properties from first principles in physics, chemistry and materials science. Continuing development of new methods is necessary for accurate…
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…
The Fast Fourier Transform (FFT) is a numerical operation that transforms a function into a form comprised of its constituent frequencies and is an integral part of scientific computation and data analysis. The objective of our work is to…
The paper presents the graph Fourier transform (GFT) of a signal in terms of its spectral decomposition over the Jordan subspaces of the graph adjacency matrix $A$. This representation is unique and coordinate free, and it leads to…
We propose a general path-integral definition of two-dimensional quantum field theories deformed by an integrable, irrelevant vector operator constructed from the components of the stress tensor and those of a $U(1)$ current. The deformed…
Jets are extended multipartonic systems and serve as a powerful tool for investigating the dynamics of emergent phenomena driven by many body QCD interactions. In heavy ion collisions, starting from their production during the perturbative…
Circuit quantum electrodynamics (QED) has emerged as a promising platform for implementing quantum computation and simulation. Typically, junctions in these systems are of a sufficiently small size, such that only the lowest plasma…
Fourier transform (FT) plays a crucial role in a broad range of applications, from enhancement, restoration and analysis through to security, compression and manipulation. The Fourier transform (FT) is a process that converts a function…
The set $X$ of $k$-subsets of an $n$-set has a natural graph structure where two $k$-subsets are connected if and only if the size of their intersection is $k-1$. This is known as the Johnson graph. The symmetric group $S_n$ acts on the…
Symmetry learning has proven to be an effective approach for extracting the hidden structure of data, with the concept of equivariance relation playing the central role. However, most of the current studies are built on architectural theory…
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…
An equi-isoclinic tight fusion frame (EITFF) is a type of Grassmannian code, being a sequence of subspaces of a finite-dimensional Hilbert space of a given dimension with the property that the smallest spectral distance between any pair of…
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
Josephson junction field-effect transistors (JJFETs) have recently re-emerged as promising candidates for superconducting computing. For JJFETs to perform Boolean logic operations, the so-called gain factor $\alpha_{R}$ must be larger than…
The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is…