Autoregressive Moving Average Graph Filter Design
J. Liu (TU Delft - Signal Processing Systems)
Elvin Isufi (TU Delft - Signal Processing Systems)
G.J.T. Leus (TU Delft - Signal Processing Systems)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
To accurately match a finite-impulse response (FIR) graph filter to a desired response, high filter orders are generally required leading to a high implementation cost. Autoregressive moving average (ARMA) graph filters can alleviate this problem but their design is more challenging. In this paper, we focus on ARMA graph filter design for a known graph. The fundamental aim of our ARMA design is to create a good match to the desired response but with less coefficients than a FIR filter. Our design methods are inspired by Prony’s method but using proper modifications to fit the design to the graph context. Compared with FIR graph filters, our ARMA graph filters show better results for the same number of coefficients.