Abstract
We propose a minimax design method for finite impulse response (FIR) graph filters in this brief. 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.