Phaseless sampling on square-root lattices

Due to its appearance in a remarkably wide field of applications, such as audio processing and coherent diffraction imaging, the short-time Fourier transform (STFT) phase retrieval problem has seen a great deal of attention in recent years. A central problem in STFT phase retrieval concerns the question for which window functions $g \in L^2(\mathbb{R}^d)$ and which sampling sets $\Lambda \subseteq \mathbb{R}^{2d}$ is every $f \in L^2(\mathbb{R}^d)$ uniquely determined (up to a global phase factor) by phaseless samples of the form $$ |V_gf(\Lambda)| = \left \{ |V_gf(\lambda)| : \lambda \in \Lambda \right \}, $$ where $V_gf$ denotes the short-time Fourier transform (STFT) of $f$ with respect to $g$. The investigation of this question constitutes a key step towards making the problem computationally tractable. However, it deviates from ordinary sampling tasks in a fundamental and subtle manner: recent results demonstrate that uniqueness is unachievable if $\Lambda$ is a lattice, i.e $\Lambda = A\mathbb{Z}^{2d}, A \in \mathrm{GL}(2d,\mathbb{R})$. Driven by this discretization barrier, the present article centers around the initiation of a novel sampling scheme which allows for unique recovery of any square-integrable function via phaseless STFT-sampling. Specifically, we show that square-root lattices, i.e., sets of the form $$ \Lambda = A \left ( \sqrt{\mathbb{Z}} \right )^{2d}, \ \sqrt{\mathbb{Z}} = \{ \pm \sqrt{n} : n \in \mathbb{N}_0 \}, $$ guarantee uniqueness of the STFT phase retrieval problem. The result holds for a large class of window functions, including Gaussians.


Introduction
Consider a window function g ∈ L 2 (R d ) and a set Λ ⊆ R 2d of sampling locations.Let V g f : R 2d → C denote the short-time Fourier transform (STFT) of f ∈ L 2 (R d ) with respect to g, given by The well-established theory in time-frequency analysis ensures that every f ∈ L 2 (R d ) is uniquely determined by the STFT-samples {V g f (λ) : λ ∈ Λ}, provided that the window function g satisfies certain mild conditions, and Λ = AZ 2d , A ∈ GL(2d, R), is a sufficiently dense lattice.Consequently, square-integrable functions can be distinguished via sampling of their STFTs.Suppose now that merely the absolute values of the STFTsamples are given, i.e., the sampling set is of the form (1) |V g f (Λ)| := {|V g f (λ)| : λ ∈ Λ} .
This leads to the phaseless sampling problem and the natural question whether a distinction of square-integrable functions is possible by considering the respective phaseless STFT samples as given in (1).The investigation of this problem is of utmost importance in a series of applications, prominent examples include coherent diffraction imaging [7,28], audio processing [24], and quantum mechanics [23].It is known as the uniqueness problem in STFT phase retrieval and has received considerable attention in recent years.Since |V g f (Λ)| = |V g (τ f )(Λ)| whenever τ ∈ T := {z ∈ C : |z| = 1} is a complex number of modulus one, it is evident that a distinction from phaseless samples of the form ( 1) is only achievable up to the ambiguity arising from multiplication by a number in T. To that end, we define for two functions f, h ∈ L 2 (R d ) the equivalence relation and say that f and h agree up to a global phase if f ∼ h.Compared to conventional sampling of the STFT, the uniqueness problem posed by phaseless samples takes a fundamentally different direction.Recently established discretization barriers have revealed that if Λ is a lattice, then functions within L 2 (R d ) cannot be uniquely determined by samples of the form of |V g f (Λ)|, regardless of the lattice choice Λ or the window function g [3,11,13].Consequently, addressing the uniqueness problem in the absence of phase information calls for new techniques and alternative sampling schemes.
The objective of the present article centers around the derivation of phaseless sampling results from square-root lattices.Precisely, we determine a function space O b a (C d ) (depending on a decay parameter a and a growth parameter b) which consists of analytic functions on C d such that the restriction to R d of every g ∈ O b a (C d ) is an element of L 2 (R d ).This function space has the following property: whenever g belongs to O b a (C d ), then every f ∈ L 2 (R d ) is determined up to a global phase by |V g f (Λ)|, provided that Λ is a square-root lattice, which satisfies a generalized density condition (see Section 1.1 for further clarifications).Thus, sampling on ordinary lattices never yields uniqueness, while a replacement by a square-root lattice does the job.It is worth mentioning that O b a (C d ) contains Gaussians, the most important window functions in contemporary STFT phase retrieval research.Moreover, a suitable choice of a and b implies that 1.1.Main results.Recall that a lattice in R d is a set of the form AZ d for some invertible matrix A ∈ GL(d, R).We call a subset Λ ⊆ R d a square-root lattice if there exists an invertible matrix A ∈ GL(d, R) such that An example of a square-root lattice is depicted in Figure (1).In analogy to an ordinary lattice, the matrix A is called the generating matrix of the square-root lattice.A square-root lattice Λ is called rectangular if its generating matrix is diagonal.The present article establishes uniqueness results for the STFT phase retrieval problem via sampling on square-root lattices.The window functions which define the STFT and for which square-root sampling implies uniqueness belong to a space of analytic functions.Before defining this space, we settle some notation.Whenever z ∈ C d , we write z = x + iy, where x ∈ R d is the real part of z, and y ∈ R d is the imaginary part of z.For two functions v, w : The space of analytic functions we are dealing with will be denoted by , j ∈ {1, . . ., d}.

Then the following statements are equivalent for every
Notice that for γ > 0 and for a suitable choice of a and b, the Gauss- In view of both theory and applications, Gaussians represent the most significant window functions as they allow for a connection to the theory of Fock spaces.
It is this particular relation which leads to the most extensive results in STFT phase retrieval with Gaussian windows [1,2,12,14,15,17,18].We therefore state two separate results on square-root sampling for Gaussiantype windows, where we also allow for multiplication by entire functions of exponential type.The first consequence of Theorem 1.1 reads as follows.
Corollary 1.2.Let γ > 0, let p : C d → C be an entire function of exponential type, and let φ ∈ L 2 (R d ) be the window function φ then the following statements are equivalent for every f, h ∈ L 2 (R d ): (1) Every polynomial is an entire function of exponential type.Hermite functions are products of Gaussians with polynomials.Recall that the Hermite functions on the real line are given by The system of Hermite basis functions The prototypical example of a Hermite function is the standard Gaussian h 0 which is given by h 0 (t) = 2 d/4 e −π∥t∥ 2 2 .Any other Hermite function is the product of h 0 with a polynomial.The choice of Hermite functions as window functions implies the following concise statement.
, then the following statements are equivalent for every f, h ∈ L 2 (R d ): (1) Finally, we note that more general versions of the previous theorems are derived where the generating matrix of the square-root lattice does not need to be diagonal.We refer to Section 4 regarding this matter.1.2.Existing work on square-root sampling.The purpose of this section is to mention several existing results on square-root sampling.The first one is a sampling result for the short-time Fourier transform with Gaussian window function.
Ascensi, Lyubarskii and Seip [5].According to [5, Theorem 1], the set Λ is a uniqueness set for the Bargmann-Fock space F 2 (C) which is defined as the collection of all entire functions where dA(z) denotes the Euclidean area measure on C. The Bargmanntransform constitutes a unitary isomorphism between F 2 (C) and L 2 (R).
In addition, it yields an intimate relation between the short-time Fourier transform V φ with window function φ(t) = 2 1/4 e −πt 2 and F 2 (C) [19,Section 3.4].In view of this one-to-one correspondence, the theorem of Ascensi, Lyubarskii and Seip implies that if Λ is defined as in (2), then the following statements are equivalent for every f, h ∈ L 2 (R d ): (1) f = h.This shows that in the presence of phase information, square-root samples which are distributed over the time-and frequency axis give rise to unique determination of every f ∈ L 2 (R).
Viazovska and Radchenko [25].Let S e (R) denote the space of even Schwartz functions f : R → R. According to [25, Corollary 1], the following two statements are equivalent for every f, h ∈ S e (R): (1) f (λ) = h(λ) and f (λ) = ĥ(λ) for every λ ∈ Z ≥0 , (2) f = h.Thus, every even Schwartz function is determined by square-root samples of itself and its Fourier transform.The proof of this statement is based on the theory of modular forms.

Preliminaries
In this section, we collect several preliminary results which are needed in the remainder of the article, in particular, in the proofs of the assertions presented in Section 1.1.The focus of study is the function space O b a (C d ) and uniqueness sets for spaces of analytic functions.

The function space O
Further, we define where The following short lemma makes an assertion about the product of an entire function of exponential type with a function in O b a (C d ).It will be of frequent use throughout the remainder of the article.
, and let G be an entire function of exponential type.Then for every ε Proof.Since G is of exponential type, there exists a positive real number σ > 0 such that Notice that for every δ > 0 there exists a constant C = C(δ) > 0 such that for every t ∈ R it holds that e σ|t| ≤ Ce δt 2 .Thus, e −(a j −ε j )x 2 j e (b j +ε j )y 2 j , We proceed with the discussion of several important properties of the function class Then the following properties hold:  d ).This shows the first two claims of the Proposition.To prove the third statement, suppose that a < b and define c := 1 2 (a + b).Then for every j ∈ {1, . . ., d} and every z ∈ C d we have This shows that the Gaussian G ∈ O(C d ) defined via ) be a polynomial.By virtue of Lemma 2.1 and the fact that p is an entire function of exponential type, it holds that pG with ε j ∈ (0, a j ) for all j ∈ {1, . . ., d}.In view of Equation (3), it follows that a sufficiently small choice of ε j implies that we have both c j − ε j > a j and c j + ε j < b j for every j ∈ {1, . . ., d}.Thus, the previous inclusion shows that pG ∈ O b a (C d ).Since p was arbitrary, every function which is a product of a polynomial with the Gaussian G is an element of O b a (C d ).In particular, O b a (C d ) contains a system of scaled Hermite functions, the span of which is known to be dense in L 2 (R d ).The statement follows from that.For the fourth assertion, we observe that if F ∈ O b a (C d ), then for every z ∈ C d it holds that (4) If a = b, then the right-hand side of Equation ( 4) is bounded, whence Liouville's theorem applies and shows the existence of a constant ν ∈ C such that F = νφ, where φ is defined as in the statement of the Proposition.Hence, O b a (C d ) ⊆ Cφ.The reverse inclusion is trivial.In order to prove the last claim, we write for j ∈ {1, . . ., d} and for z ∈ C d If d = 1, we skip the definition of z ′ .We then have where Suppose that a j > b j holds for some j ∈ {1, . . ., d}.Then, it follows from Liouville's theorem that the map z j → F (z 1 , . . ., z d ) vanishes identically.Since z ′ was arbitrary, we have Utilizing Jensen's formula, we are well-equipped to prove the following uniqueness statement.
For each j ∈ {1, . . ., d} let for every j ∈ {1, . . ., d}, then If on the other hand, for some j ∈ {1, . . ., d}, then Proof Assume that F vanishes on Λ\{0} (excluding zero because of the assumption that F (0) is, without loss of generality, equal to one), but does not vanish identically.Choosing r = λ(k) and s > 1 yields n(r) ≥ 2k and This in turn shows the validity of the inequality where we used the elementary estimate √ p + q ≤ √ p + √ q for p, q ≥ 0.
Maximizing the left-hand side of Equation ( 5) with respect to s > 1 gives resulting in the lower lim inf-bound then this gives a contradiction and F must vanish identically.
To perform the induction step, we suppose that the assertion holds for d − 1.For a fixed p ∈ Λ 1 , the map Then S is an entire function which vanishes on Λ 1 and satisfies the bound Therefore, it holds that S ∈ O b 1 (C).The case d = 1 shows that S vanishes identically and the arbitrariness of (p 2 , . . ., p d ) ∈ C d−1 concludes the proof of the statement.
Step 2. To prove the second part of the statement, we again start with It follows that there exists an integer K ∈ N such that ( 6) Define γ(k) := λ(k) 2 and Γ := {γ(k) : k ≥ K}.The Weierstrass factorization of the hyperbolic sine is given by sinh The lower bound given in (6) implies that , it follows from the previous estimate and the definition of the hyperbolic sine, that Observe that F is a non-trivial entire function that vanishes on Γ (in fact, it vanishes on Γ ∪ (−Γ)).Now define , then there exists a non-trivial function F ∈ O b j (C) that vanishes on Λ j .Consequently, the function This yields the assertion.□

Proof of the main results
This section is devoted to the proofs of Theorem 1.1, Corollary 1.2, and Corollary 1.3.After proving the statements, we provide a list of remarks concerning extensions and comparisons to previous and future work.We start with the proof of Theorem 1.1.To this end, we introduce the following notation: if p, q ∈ [1, ∞] are conjugate to each other, i.e., 1  p + 1 q = 1, and if and its reflection is the map ) to a unitary operator on L 2 (R d ) is carried out in the usual way.Notice that the short-time Fourier transform satisfies the identity V g f (x, ω) = F(f T x g)(ω).Finally, we define for a vector ω ∈ C d and f : We call f ω the tensor product of f .If f is assumed to be entire, then for every ω ∈ C d , and every t ∈ C d , both maps define entire functions from C d to C. In order to establish the proof of Theorem 1.1, a series of preliminary statements is needed.The first of these is a well-known result that relates STFTs of the form V f f to the equivalence relation ∼ [6,19].
The second lemma pertains to parameter integrals with respect to a complex variable [21,26].Lemma 3.2.Let F : R d × C d → C be a function subjected to the following assumptions: (1) Then z → R d F (t, z) dt defines an entire function of d complex variables.
To proceed, we combine Lemma 3.1 with Lemma 3.2 to make a first assertion on STFT phase retrieval with window in O b a (C d ).This analysis is made under the assumption that complete spectrograms are available.The discretization step is performed in the subsequent stage.
Proof.Consider the absolute value of the STFT of a function f ∈ L 2 (R d ) with respect to the window function φ in the second argument, i.e., the map ω → |V φ f (x, ω)| 2 for some fixed x ∈ R d .Using the definition of the STFT as the Fourier transform of the product of f with a shift of φ yields the identity Combining Equation (7) with Equation (8) shows that the spectrogram satisfies the identity ( 9) It follows, that for every fixed ω ∈ R d , the map vanishes identically.Applying the Fourier transform to Q ω yields the relation = 0, which holds for every x ∈ R d .Observe that the function R(φ ω ) has Gaussian decay and since φ ̸ = 0 it does not vanish identically.Applying Lemma 3.2, shows that the map x → F(R(φ ω ))(x) extends from R d to an entire function which does not vanish identically.In particular, the set for every (ω, y) ∈ R 2d .The statement follows from Lemma 3.1.□ The next lemma constitutes a key component in the proof of Theorem 1.1.It asserts, that the modulus squared of the short-time Fourier transform, |V φ f | 2 , extends from R 2d to an entire function belonging to and let The modulus of the inner product of an arbitrary function u ∈ L 1 (R d ) with a complex shift of φ t by z = x + iρ is therefore upper bounded by Now replace in the previous estimate the function u by the tensor product f t where f ∈ L 2 (R d ).The Cauchy-Schwarz inequality shows that ( 12) Eq. ( 11),( 12) for some constant C(a) depending only on a.Moreover, an application of Lemma 3.2 shows that F defines an entire function on C 2d .
Step 2. We apply the bounds derived in Step 1 to the modulus squared of the STFT.To do so, we make use of Equation (9), derived in the proof of Corollary 9.In terms of the function F as defined as in Equation ( 13), we have that for every (x, ω) ∈ R 2d .According to Step 1, the function F extends from R 2d to an entire function of 2d complex variables and satisfies the growth estimate This implies that for c ∈ R 2d >0 given as in Equation ( 10), we have We are ready to proof Theorem 1.1 from Section 1.1.
or, equivalently, According to Lemma 3.4, it holds that for some ε ∈ (0, γ).For a sufficiently small choice of ε, the assumptions on α and β imply that The statement therefore follows from Theorem 1.1.□ Notice that Corollary 1.3 follows at once from Corollary 1.2 simply by the choice γ = π and the fact that every polynomial is an entire function of exponential type.

Beyond diagonal generating matrices
We aim to extend the results of Section 3 to the situation where the generating matrix of the square-root lattice is not necessarily diagonal.To this end, we recall that an invertible matrix S ∈ R 2d×2d is called symplectic if S T J S = J where J denotes the standard symplectic matrix and I d denotes the identity matrix in R d×d .The collection of all symplectic matrices in R 2d×2d is called the symplectic group and is denoted by Sp(2d, R).To make matters more concrete, we focus in the following on the STFT phase retrieval problem with Gaussian window and set the dimension to d = 1.This regime has been studied the most extensively among STFT phase retrieval problems with different window functions.A general uniqueness result for sampling on square-root lattices reads as follows.
Theorem 4.1.Let S ∈ SL 2 (R) and p, q > 0 be given by then the following statements are equivalent for every f, h ∈ L 2 (R): According to [8, Proposition 252], there exists a constant C ∈ C \ {0} such that Ŝφ(t) = Ce −πct 2 , where Thus, for x, y ∈ R we have | Ŝφ(x + iy)| ≲ e −πp(x 2 −y 2 −2xy(ac+bd)) ≤ e −πpx 2 e πpy 2 e 2πxyq .Using Young's inequality we obtain the bound This shows that Ŝφ ∈ O π(p+q) π(p−q) (C).Combining Theorem 1.1 with condition (14) and identity (15), implies that Ŝf ∼ Ŝh.Since the equivalence relation "∼" is invariant under applications of invertible linear operators, it follows that f ∼ h.Remark 4.4 (Analyticity of the short-time Fourier transform).Let g be a window function and let V g f (x, ω) be the STFT of f with respect to g, evaluated at (x, ω) ∈ R 2d .For simplicity we assume in this remark that d = 1.If we write z = x + iω ∈ C, then the STFT gives rise to the map ( 16) If g is a Gaussian window function, then, modulo a multiplication by a nonzero weighting factor, Equation ( 16) defines an antiholomorphic function.Therefore, this case directly allows for the application of techniques from complex analysis and constitutes the main reason for the choice of Gaussian windows in most articles on STFT phase retrieval.A classical result of Asenci and Bruna shows that the Gaussian is essentially the only function which renders V g f into an analytic function in the above sense [4, Theorem 2.1].Observe that the results obtained in the present article hold for a variety of window functions which are different from Gaussians (in fact, O b a (C d ) is dense in L 2 (R d ) for a < b, as stated in Proposition 2.2).Our techniques therefore do not rely on the intimate relation to analytic functions induced by Gaussian windows.Remark 4.5 (Support constraints).Corollary 1.2 states that if the window function is the product of a Gaussian with an entire function of exponential type, then every square-integrable function f ∈ L 2 (R d ) is determined up to a global phase by its phaseless STFT samples located on a separable squareroot lattice.For precisely this choice of a window function, it is shown in [16], that ordinary separable lattices (Λ = αZ d × βZ d ) yield uniqueness in classes of compactly supported functions.Specifically, if K ⊆ R d is a compact set and φ is chosen as in Corollary 1.2, then there exist α, β > 0 such that the following two statements are equivalent for every f, h ∈ L 2 (K) (we stress the support constraint on f and h): (1) |V φ f (λ)| = |V φ h(λ)| for every λ ∈ αZ d × βZ d , (2) f ∼ h.
Because of the discretization constraints derived in [11], achieving an equivalence of the same nature becomes unattainable when substituting L 2 (K) with L 2 (R d ) and employing phaseless sampling on regular lattices.However, the findings in the current paper come into play in this scenario and demonstrate that uniqueness can be achieved by substituting the regular lattice with a square-root lattice.
Remark 4.6 (Applications and algorithm design).Phase retrieval is a fundamental problem that arises in various fields, including coherent diffraction imaging, audio processing, and quantum mechanics.In these applications, only discrete samples are available, due to the limitations of digital devices, giving rise to the uniqueness problem investigated in the present article.While phase retrieval from the absolute value of the STFT on the entire timefrequency plane R 2d is well-documented, the uniqueness question becomes a substantial hurdle when only discrete samples are accessible.The outcomes of the present paper reveal the first uniqueness results for this problem in situations where no constraints on the underlying function space are imposed, shedding light on a previously unexplored aspect of phase retrieval.The square-root lattice scheme is designed to address the challenges posed by the uniqueness problem from discrete samples.The sampling points of this scheme exhibit the behavior of becoming more clustered the further one moves away from the origin in the time-frequency plane.This observation not only implies the potential benefits of denser sampling away from the origin in practical applications, but also underscores the importance of incorporating a notion of irregularity in sampling positions when designing new algorithms for phase retrieval.Unlike previous approaches that predominantly focused on lattice-based sampling, this insight suggests that embracing sampling irregularities can lead to more robust and effective phase retrieval algorithms tailored to real-world scenarios.Our results therefore provide a promising avenue for further research and practical applications in the aforementioned fields.

x 2 j e b j y 2 jTheorem 1 . 1 .
C d ) denotes the space of entire functions of d complex variables.The function class O b a (C d ) is a linear subspace of O(C d ) ∩ L 2 (R d ) (the space of all entire functions which are square-integrable on R d ), and if a < b (i.e., a j < b j for every j ∈ {1, . . ., d}), then O b a (C d ) is dense in L 2 (R d ).Note that we will repeatedly identify entire functions with their restriction on R d , and vice versa, functions on R d with their analytic extension on C d (provided the extension exists).We refer to Section 2.1 for a detailed discussion of properties of O b a (C d ).Window functions which belong to the function space O b a (C d ) lead to phaseless sampling results from square-root lattices.This is the content of the following theorem which constitutes the main result of the article.Let a, b ∈ R d >0 , and let 0

Figure 1 .
Figure 1.The left figure depicts an ordinary lattice of the form AZ 2 while the right figure visualizes a square-root lattice B( √ Z) 2 (A, B ∈ GL(2, R)).
The parameters a and b govern the growth and the decay of F ∈ O b a (C d ): the constant b upper bounds the growth of F on C d whilst a simultaneously lower bounds the decay rate of F on R d .It follows, that every F ∈ O b a (C d ) is an entire function of order at most two in each complex variable.Recall that an entire function F ∈ O(C) is said to be of finite order if there exists a positive number c > 0 such that |F (z)| ≲ e |z| c .The smallest non-negative number ρ ≥ 0 such that |F (z)| ≲ e |z| ρ+ε for every ε > 0 is called the order of F .The order of a non-constant entire function F is given by the formula ρ = lim sup r→∞ log log M (r) log r , where M (r) = max z∈∂Br(0) |F (z)| denotes the maximum-modulus function of F , and ∂B r (0) := {z ∈ C : |z| = r}.An entire function G : C d → C is said to be of exponential type if it is of order one in each variable, that is, there exists a positive real number σ > 0 such that |G(z)| ≲ e σ∥z∥ 1

Proof.
The property of O b a (C d ) being a linear space of entire functions follows directly from its definition.Since every F ∈ O b a (C d ) has Gaussian decay on R d , we further deduce the inclusion O b a (C d ) ⊆ L 2 (R d ).The inclusion O b a (C d ) ⊆ O b a (C d ) with a, b defined as above follows at once from the definition of O b a (C

. 2 .Lemma 2 . 3 .
Uniqueness sets for O b (C d ).Let S ⊆ O(C d ) be a linear space.A set Λ ⊆ C d is said to be a uniqueness set for S if for every F ∈ S it holds that (F (λ) = 0 ∀λ ∈ Λ) =⇒ F = 0. Clearly, every open set in Λ ⊆ C d is a uniqueness set for O(C d ).If Λ is contained in R d , then the following can be said [13, Lemma 3.4].Let Λ ⊆ R d be a Lebesgue-measurable set such that L d (Λ) > 0, where L d denotes the d-dimensional Lebesgue measure.Then Λ is a uniqueness set for O(C d ).Our objective now is to establish uniqueness sets for the class O b (C d ), b ∈ R d >0 , which are discrete subsets of R d .To achieve this, we introduce the zerocounting function.Given 0 < r < R and an analytic function F defined on the open unit ball B R (0) = z ∈ C : |z| < R, we denote by n(r) the number of zeros F within the region where |z| ≤ r (counting multiplicities).This defines a map n : [0, R) → N 0 .Jensen's formula relates the distribution of zeros of an analytic function to its growth [27, p. 50].Theorem 2.4 (Jensen).Let 0 < r < R and suppose that F ∈ O(B R (0)) satisfies F (0) ̸ = 0.If z 1 , . . ., z n are the zeros of F for which |z j | ≤ r (counting multiplicities), then 1 2π 2π 0 log |F (re iθ )| dθ = log |F (0)| + n j=1 log r |z j | = log |F (0)| + r 0 n(t) t dt.

. Step 1 .log
We prove the first part of the statement via induction over the dimension d ∈ N. To this end, let d = 1, let Λ := Λ 1 with Λ = {±λ(k) : k ∈ N 0 }, and let b := b 1 .Suppose that F : C → C is an entire function which satisfies the bound |F (z)| ≲ e b|z| 2 .Without loss of generality we may suppose that F (0) = 1.For if F (0) / ∈ {0, 1}, then one may use a scaling argument, and if F has a zero of order m at zero then one may consider F (z)/z m .Let n(r) denote the number of zeros of F in the closed ball B r (0) := {z ∈ C : |z| ≤ r} ⊆ C of radius r > 0. Combining the assumption that F (0) = 1 with Jensen's formula implies the identity |F (re iθ )| dθ.Since |F (z)| ≤ Ce b|z| 2 for some constant C > 0, the previous equality yields the estimate r 0 n(t) t dt ≤ log C + br 2 .Now let s > 1.The property of t → n(t) being non-decreasing shows that

Proof. Step 1 .
to an entire functions belonging to the space O c (C 2d ).Let z = x+iρ ∈ C d with x, ρ ∈ R d and consider the modulus of a complex shift of φ t by z, i.e., the map |T z φ t |.Employing the definition of the class O b a (C d ) yields the estimate

Figure 2 .
Figure 2. The left figure depicts a sheared square-root lattice.The right figure depicts a rotated square-root lattice.
the spectrograms of f and h with respect to the window function φ, agree everywhere on R d .Corollary 3.3 implies that f ∼ h.□ With the proof of Theorem 1.1 now established, we can seamlessly proceed to derive the proof for Corollary 1.2.
R), the special linear group in R 2×2 .The metaplectic group Mp(d) is the unitary representation of the double cover of the symplectic group Sp(2d, R) on L 2 (R d ).Briefly speaking, to every symplectic matrix S ∈ Sp(2d, R) corresponds a unitary operator Ŝ : L 2 (R d ) → L 2 (R d ) (defined up to a sign factor), that satisfies the relation |V [10](S(x, ω))| = |V Ŝg ( Ŝf )(x, ω)|, for every f, g ∈ L 2 (R d ), S ∈ Sp(2d, R) and (x, ω) ∈ R 2d [19, Lemma 9.4.3].The application of metaplectic operators constitutes a classical technique in time-frequency analysis for transferring statements about separable lattices to non-separable ones.An extensive exposition on metaplectic operators can be found in a book by Folland[10].