Graph Signal Processing: Modulation, Convolution, and Sampling
Reviewed by Pithpith:BJPM6AMKopen to challenge →
read the original abstract
To analyze data supported by arbitrary graphs G, DSP has been extended to Graph Signal Processing (GSP) by redefining traditional DSP concepts like shift, filtering, and Fourier transform among others. This paper revisits modulation, convolution, and sampling of graph signals as appropriate natural extensions of the corresponding DSP concepts. To define these for both the vertex and the graph frequency domains, we associate with generic data graph G and its graph shift A, a graph spectral shift M and a spectral graph Gs. This leads to a spectral GSP theory that parallels in the graph frequency domain the existing GSP theory in the vertex domain. The paper applies this to design and recovery sampling techniques for data supported by arbitrary directed graphs.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Minimal Isometric Embeddings of Graphs into Abelian Groups: Theory, Algorithms, and Applications to Signal Processing over Networks
Every connected graph embeds isometrically into a Cayley graph of (Z_2)^k with k <= n-1 via new edge relations and a quotient labeling theorem, enabling group-based harmonic analysis on graphs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.