WLS Design of ARMA Graph Filters using Iterative Second-Order Cone Programming
We propose a weighted least-square (WLS) method to design autoregressive moving average (ARMA) graph filters. We first express the WLS design problem as a numerically-stable optimization problem using Chebyshev polynomial bases. We then formulate the optimization problem with a nonconvex objective function and linear constraints for stability. We employ a relaxation technique and convert the nonconvex optimization problem into an iterative second-order cone programming problem. Experimental results confirm that ARMA graph filters designed using the proposed WLS method have significantly improved frequency responses compared to those designed using previously proposed WLS design methods.
PDF AbstractTasks
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.
