Quantization Analysis and Robust Design for Distributed Graph Filters

Leila Ben Saad, Baltasar Beferull-Lozano, Elvin Isufi

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)
26 Downloads (Pure)


Distributed graph filters have recently found applications in wireless sensor networks (WSNs) to solve distributed tasks such as reaching consensus, signal denoising, and reconstruction. However, when implemented over WSNs, the graph filters should deal with network limited energy constraints as well as processing and communication capabilities. Quantization plays a fundamental role to improve the latter but its effects on distributed graph filtering are little understood. WSNs are also prone to random link losses due to noise and interference. In this instance, the filter output is affected by both the quantization error and the topological randomness error, which, if it is not properly accounted in the filter design phase, may lead to an accumulated error through the filtering iterations and significantly degrade the performance. In this paper, we analyze how quantization affects distributed graph filtering over both time-invariant and time-varying graphs. We bring insights on the quantization effects for the two most common graph filters: the finite impulse response (FIR) and autoregressive moving average (ARMA) graph filter. Besides providing a comprehensive analysis, we devise theoretical performance guarantees on the filter performance when the quantization stepsize is fixed or changes dynamically over the filtering iterations. For FIR filters, we show that a dynamic quantization stepsize leads to more reduction of the quantization noise than in the fixed-stepsize quantization. For ARMA graph filters, we show that decreasing the quantization stepsize over the iterations reduces the quantization noise to zero at the steady-state. In addition, we propose robust filter design strategies that minimize the quantization noise for both time-invariant and time-varying networks. Numerical experiments on synthetic and two real data sets corroborate our findings and show the different trade-offs between quantization bits, filter order, and robustness to topological randomness.

Original languageEnglish
Article number9665348
Pages (from-to)643 - 658
Number of pages16
JournalIEEE Transactions on Signal Processing
Publication statusPublished - 2022

Bibliographical note

Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.


Dive into the research topics of 'Quantization Analysis and Robust Design for Distributed Graph Filters'. Together they form a unique fingerprint.

Cite this