On the existence of optimizers for time–frequency concentration problems

Fabio Nicola, José Luis Romero, S. Ivan Trapasso

Publications: Contribution to journalArticlePeer Reviewed

Abstract

We consider the problem of the maximum concentration in a fixed measurable subset Ω ⊂ R2d of the time-frequency space for functions f∈ L2(Rd). The notion of concentration can be made mathematically precise by considering the Lp-norm on Ω of some time–frequency distribution of f such as the ambiguity function A(f). We provide a positive answer to an open maximization problem, by showing that for every subset Ω ⊂ R2d of finite measure and every 1 ≤ p< ∞, there exists an optimizer for sup{‖A(f)‖Lp(Ω):f∈L2(Rd),‖f‖L2=1}.The lack of weak upper semicontinuity and the invariance under time-frequency shifts make the problem challenging. The proof is based on concentration compactness with time–frequency shifts as dislocations, and certain integral bounds and asymptotic decoupling estimates for the ambiguity function. We also discuss the case p= ∞ and related optimization problems for the time correlation function, the cross-ambiguity function with a fixed window, and for functions in the modulation spaces Mq(Rd) , 0 < q< 2 , equipped with continuous or discrete-type (quasi-)norms.

Original languageEnglish
Article number21
JournalCalculus of Variations and Partial Differential Equations
Volume62
Issue number1
DOIs
Publication statusPublished - Jan 2023

Funding

The authors are very grateful to Karlheinz Gröchenig for bringing to their attention the problem solved here, in connection to an unpublished manuscript of his and Markus Neuhauser. The present research has been partially supported by the MIUR grant Dipartimenti di Eccellenza 2018–2022, CUP: E11G18000350001, DISMA, Politecnico di Torino. J. L. R. gratefully acknowledges support from the Austrian Science Fund (FWF): Y 1199. S. I. T. is member of the Machine Learning Genoa (MaLGa) Center, Università di Genova. F. N. and S. I. T. are members of the Gruppo Nazionale per l’Analisi Matematica, la Probabilità e le loro Applicazioni (GNAMPA) of the Istituto Nazionale di Alta Matematica (INdAM). The authors are very grateful to Karlheinz Gröchenig for bringing to their attention the problem solved here, in connection to an unpublished manuscript of his and Markus Neuhauser. The present research has been partially supported by the MIUR grant Dipartimenti di Eccellenza 2018–2022, CUP: E11G18000350001, DISMA, Politecnico di Torino. J. L. R. gratefully acknowledges support from the Austrian Science Fund (FWF): Y 1199. S. I. T. is member of the Machine Learning Genoa (MaLGa) Center, Università di Genova. F. N. and S. I. T. are members of the Gruppo Nazionale per l’Analisi Matematica, la Probabilità e le loro Applicazioni (GNAMPA) of the Istituto Nazionale di Alta Matematica (INdAM).

Austrian Fields of Science 2012

  • 101002 Analysis

Fingerprint

Dive into the research topics of 'On the existence of optimizers for time–frequency concentration problems'. Together they form a unique fingerprint.

Cite this