Graph filter design using sum-of-squares representation

Tuomas Aittomäki, Geert Leus

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

8 Citations (Scopus)
45 Downloads (Pure)

Abstract

Graph filters are an essential part of signal processing on graphs enabling one to modify the spectral content of the graph signals. This paper proposes a graph filter optimization method with an exact control of the ripple on the passband and the stopband of the filter. The proposed filter design method is based on the sum-of-squares representation of positive polynomials. The optimization of both FIR and ARMA graph filters is convex with the proposed method.

Original languageEnglish
Title of host publicationEUSIPCO 2019 - 27th European Signal Processing Conference
PublisherEuropean Signal Processing Conference, EUSIPCO
Pages1-5
Number of pages5
Volume2019-September
ISBN (Electronic)9789082797039
DOIs
Publication statusPublished - 2019
Event27th European Signal Processing Conference, EUSIPCO 2019 - A Coruna, Spain
Duration: 2 Sept 20196 Sept 2019

Conference

Conference27th European Signal Processing Conference, EUSIPCO 2019
Country/TerritorySpain
CityA Coruna
Period2/09/196/09/19

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.

Keywords

  • Convex optimization
  • Filter design
  • Graph filters

Fingerprint

Dive into the research topics of 'Graph filter design using sum-of-squares representation'. Together they form a unique fingerprint.

Cite this