Papers
Topics
Authors
Recent
Search
2000 character limit reached

The norm of time-frequency and wavelet localization operators

Published 18 Jul 2022 in math.CA and math.FA | (2207.08624v2)

Abstract: Time-frequency localization operators (with Gaussian window) $L_F:L2(\mathbb{R}d)\to L2(\mathbb{R}d)$, where $F$ is a weight in $\mathbb{R}{2d}$, were introduced in signal processing by I. Daubechies in 1988, inaugurating a new, geometric, phase-space perspective. Sharp upper bounds for the norm (and the singular values) of such operators turn out to be a challenging issue with deep applications in signal recovery, quantum physics and the study of uncertainty principles. In this note we provide optimal upper bounds for the operator norm $|L_F|{L2\to L2}$, assuming $F\in Lp(\mathbb{R}{2d})$, $1<p<\infty$ or $F\in Lp(\mathbb{R}{2d})\cap L\infty(\mathbb{R}{2d})$, $1\leq p<\infty$. It turns out that two regimes arise, depending on whether the quantity $|F|{Lp}/|F|_{L\infty}$ is less or greater than a certain critical value. In the first regime the extremal weights $F$, for which equality occurs in the estimates, are certain Gaussians, whereas in the second regime they are proved to be truncated Gaussians, degenerating in a multiple of a characteristic function of a ball for $p=1$. This phase transition through truncated Gaussians appears to be a new phenomenon in time-frequency concentration problems. For the analogous problem for wavelet localization operators -- where the Cauchy wavelet plays the role of the above Gaussian window -- a complete solution is also provided.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.