Abstract
Graph signals are signals indexed by nodes of the graph. Graph Signal Processing (GSP) extends Discrete Signal Processing (DSP) to graph signals.In this paper, we explore shifting, convolution, and modulation for graph signals. We begin by reviewing some basic concepts in GSP. Then, we define M, the spectral domain shift analogous to the vertex domain shift, A. Finally, we use A and M and polynomial filters, P (A) and P (M), to illustrate convolution and modulation for graph signals in both the vertex and spectral domain.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call