Sampling Theory of Bandlimited Continuous-Time Graph Signals

20 Oct 2020  ·  Feng Ji, Hui Feng, Hang Sheng, Wee Peng Tay ·

A continuous-time graph signal can be viewed as a time series of graph signals. It generalizes both the classical continuous-time signal and ordinary graph signal. Therefore, such a signal can be considered as a function on two domains: the graph domain and the time domain. In this paper, we consider the sampling theory of bandlimited continuous-time graph signals. To formulate the sampling problem, we need to consider the interaction between the graph and time domains. We describe an explicit procedure to determine a discrete sampling set for perfect signal recovery. Moreover, in analogous to the Nyquist-Shannon sampling theorem, we give an explicit formula for the minimal sample rate.

PDF Abstract

Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods


No methods listed for this paper. Add relevant methods here