Related papers: Algebraic Signal Processing Theory
In this paper we propose a framework to leverage Lie group symmetries on arbitrary spaces exploiting \textit{algebraic signal processing} (ASP). We show that traditional group convolutions are one particular instantiation of a more general…
To describe external and internal attributes of fundamental fermions, a theory of multi-spinor fields is developed on an algebra, a {\it triplet algebra}, which consists of all the triple-direct-products of Dirac \gamma-matrices. The…
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…
Module is effective representation of ring in Abelian group. Linear map of module over commutative ring is morphism of corresponding representation. This definition is the main subject of the book. To consider this definition from more…
Basic operations in graph signal processing consist in processing signals indexed on graphs either by filtering them, to extract specific part out of them, or by changing their domain of representation, using some transformation or…
We consider the $\alpha$-sine transform of the form $T_\alpha f(y)=\int_0^\infty\vert\sin(xy)\vert^\alpha f(x)dx$ for $\alpha>-1$, where $f$ is an integrable function on $\mathbb{R}_+$. First, the inversion of this transform for $\alpha>1$…
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…
We consider the problem of "algebraic reconstruction" of linear combinations of shifts of several known signals $f_1,\ldots,f_k$ from the Fourier samples. Following \cite{Bat.Sar.Yom2}, for each $j=1,\ldots,k$ we choose sampling set $S_j$…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
Implementing general functions of operators is a powerful tool in quantum computation. It can be used as the basis for a variety of quantum algorithms including matrix inversion, real and imaginary-time evolution, and matrix powers. Quantum…
We define a nonlinear Fourier transform which maps sequences of contractive $n \times n$ matrices to $SU(2n)$-valued functions on the circle $\mathbb{T}$. We characterize the image of finitely supported sequences and square-summable…
The weak operator topology closed operator algebra on $L^2(R)$ generated by the one-parameter semigroups for translation, dilation and multiplication by $exp(i\lambda x), \lambda \geq 0$, is shown to be a reflexive operator algebra, in the…
Graphons are infinite-dimensional objects that represent the limit of convergent sequences of graphs as their number of nodes goes to infinity. This paper derives a theory of graphon signal processing centered on the notions of graphon…
Following the idea of the fractional space-time Fourier transform, a linear canonical space-time transform for 16-dimensional space-time $C\ell_{3,1}$-valued signals is investigated in this paper. First, the definition of the proposed…
The notion of Fourier transformation is described from an algebraic perspective that lends itself to applications in Symbolic Computation. We build the algebraic structures on the basis of a given Heisenberg group (in the general sense of…
Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the discrete Fourier transform and fast Fourier transform by means…
We develop Algebraic Phase Theory (APT), an axiomatic framework for extracting intrinsic algebraic structure from phase based analytic data. From minimal admissible phase input we prove a general phase extraction theorem that yields…
Signal processing on directed graphs (digraphs) is problematic, since the graph shift, and thus associated filters, are in general not diagonalizable. Furthermore, the Fourier transform in this case is now obtained from the Jordan…
We introduce a process algebra that concerns the timed behaviour of distributed systems with a known spatial distribution. This process algebra provides a communication mechanism that deals with the fact that a datum sent at one point in…
The boundary operator is a linear operator that acts on a collection of high-dimensional binary points (simplices) and maps them to their boundaries. This boundary map is one of the key components in numerous applications, including…