LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Minimax Design of Computationally-Efficient FIR Graph Filters Using Semidefinite Programming

Photo from wikipedia

We propose a minimax design method for finite impulse response (FIR) graph filters in this paper. We first convert the graph filter design problem into a numerically stable equivalent problem… Click to show full abstract

We propose a minimax design method for finite impulse response (FIR) graph filters in this paper. We first convert the graph filter design problem into a numerically stable equivalent problem using a shifted monomial basis. Then, we convert the minimax graph filter design problem into a semidefinite programming problem. Furthermore, we propose a computationally-efficient structure to implement the FIR graph filters designed using the proposed method. Design examples confirm that the proposed method can be used to design FIR graph filters having reasonably high orders, and the proposed implementation structure substantially saves additions required to process a graph signal compared to graph filters designed using a previously proposed Chebyshev polynomial approximation method.

Keywords: graph filters; minimax; fir graph; design; graph

Journal Title: IEEE Transactions on Circuits and Systems II: Express Briefs
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.