Designing Gabor windows using convex optimization

From MaRDI portal
Publication:2323488

DOI10.1016/J.AMC.2018.01.035zbMATH Open1427.42037arXiv1401.6033OpenAlexW2963293266WikidataQ130108260 ScholiaQ130108260MaRDI QIDQ2323488FDOQ2323488


Authors: Nathanaël Perraudin, Nicki Holighaus, Peter Søndergaard, P. Balazs Edit this on Wikidata


Publication date: 2 September 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: Redundant Gabor frames admit an infinite number of dual frames, yet only the canonical dual Gabor system, constructed from the minimal l2-norm dual window, is widely used. This window function however, might lack desirable properties, e.g. good time-frequency concentration, small support or smoothness. We employ convex optimization methods to design dual windows satisfying the Wexler-Raz equations and optimizing various constraints. Numerical experiments suggest that alternate dual windows with considerably improved features can be found.


Full work available at URL: https://arxiv.org/abs/1401.6033




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: Designing Gabor windows using convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2323488)