CaltechAUTHORS
  A Caltech Library Service

Node-asynchronous Implementation of Rational Filters on Graphs

Teke, Oguzhan and Vaidyanathan, P. P. (2019) Node-asynchronous Implementation of Rational Filters on Graphs. In: 2019 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE , Piscataway, NJ, pp. 7530-7534. ISBN 978-1-5386-4658-8. https://resolver.caltech.edu/CaltechAUTHORS:20190424-093013122

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190424-093013122

Abstract

This paper considers a node-asynchronous implementation of rational ("IIR") filters on graphs, in which the nodes are assumed to wake up randomly and independently from each other, and communicate only with their immediate neighbors. The underlying graph is allowed to be directed, possibly with a non-diagonalizable adjacency matrix. Since the nodes are allowed to act independently, the proposed implementation is practical for very large or autonomous networks where synchronization is difficult to achieve. Furthermore, the proposed algorithm is 1-hop localized on the graph irrespective of the order of the filter. The method is shown to converge in the mean-squared sense under a boundedness assumption on the filter as well as the graph operator. The result follows from the convergence of a more general randomized asynchronous state recursion, which is also presented in this paper. The algorithm is simulated on a random geometric graph, which numerically verifies the convergence.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ICASSP.2019.8682946DOIArticle
ORCID:
AuthorORCID
Teke, Oguzhan0000-0002-1131-5206
Vaidyanathan, P. P.0000-0003-3003-7042
Additional Information:© 2019 IEEE. This work was supported in parts by the ONR grants N00014-17-1-2732 and N00014-18-1-2390, the NSF grant CCF-1712633, and the Electrical Engineering Carver Mead Research Seed Fund of the California Institute of Technology.
Funders:
Funding AgencyGrant Number
Office of Naval Research (ONR)N00014-17-1-2732
Office of Naval Research (ONR)N00014-18-1-2390
NSFCCF-1712633
Carver Mead Seed FundUNSPECIFIED
Subject Keywords:Graph signal processing, node-asynchronous iterations, rational graph filters, distributed processing
Record Number:CaltechAUTHORS:20190424-093013122
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20190424-093013122
Official Citation:O. Teke and P. P. Vaidyanathan, "Node-asynchronous Implementation of Rational Filters on Graphs," ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brighton, United Kingdom, 2019, pp. 7530-7534. doi: 10.1109/ICASSP.2019.8682946
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:94912
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:24 Apr 2019 17:24
Last Modified:03 Oct 2019 21:08

Repository Staff Only: item control page