Abstract
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
where \(V_gf\) denotes the 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 \textrm{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
guarantee uniqueness of the STFT phase retrieval problem. The result holds for a large class of window functions, including Gaussians
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Consider a window function \(g \in {L^2({\mathbb R}^d)}\) and a set \(\Lambda \subseteq {\mathbb R}^{2d}\) of sampling locations. Let \(V_gf: {\mathbb R}^{2d} \rightarrow {\mathbb C}\) denote the short-time Fourier transform (STFT) of \(f \in {L^2({\mathbb R}^d)}\) with respect to g, given by
The well-established theory in time-frequency analysis ensures that every \(f \in {L^2({\mathbb R}^d)}\) is uniquely determined by the STFT-samples \(\{ V_gf(\lambda ): \lambda \in \Lambda \}\), provided that the window function g satisfies certain mild conditions, and \(\Lambda = A{\mathbb Z}^{2d}, A \in \textrm{GL}(2d,{\mathbb 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 STFT-samples are given, i.e., the sampling set is of the form
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_gf(\Lambda )|=|V_g(\tau f)(\Lambda )|\) whenever \(\tau \in {\mathbb T}{:}{=}\{ z \in {\mathbb 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 \({\mathbb T}\). To that end, we define for two functions \(f,h \in {L^2({\mathbb R}^d)}\) the equivalence relation
and say that f and h agree up to a global phase if \(f \sim 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 \(\Lambda \) is a lattice, then functions within \({L^2({\mathbb R}^d)}\) cannot be uniquely determined by samples of the form of \(|V_gf(\Lambda )|\), regardless of the lattice choice \(\Lambda \) 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 \(\mathcal {O}_a^b({{\mathbb C}^d})\) (depending on a decay parameter a and a growth parameter b) which consists of analytic functions on \({\mathbb C}^d\) such that the restriction to \({{\mathbb R}^d}\) of every \(g \in \mathcal {O}_a^b({{\mathbb C}^d})\) is an element of \({L^2({\mathbb R}^d)}\). This function space has the following property: whenever g belongs to \(\mathcal {O}_a^b({{\mathbb C}^d})\), then every \(f \in {L^2({\mathbb R}^d)}\) is determined up to a global phase by \(|V_gf(\Lambda )|\), provided that \(\Lambda \) is a square-root lattice,
which satisfies a generalized density condition (see Sect. 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 \(\mathcal {O}_a^b({{\mathbb 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 \(\mathcal {O}_a^b({{\mathbb C}^d})\) is dense in \({L^2({\mathbb R}^d)}\).
1.1 Main Results
Recall that a lattice in \({{\mathbb R}^d}\) is a set of the form \(A{\mathbb Z}^d\) for some invertible matrix \(A \in \textrm{GL}(d,{\mathbb R})\). We call a subset \(\Lambda \subseteq {{\mathbb R}^d}\) a square-root lattice if there exists an invertible matrix \(A \in \textrm{GL}(d,{\mathbb R})\) such that
where \(\sqrt{{\mathbb Z}} {:}{=}\{ \pm \sqrt{n}: n \in {\mathbb N}_0 \}\). An example of a square-root lattice is depicted in Fig. 1. In analogy to an ordinary lattice, the matrix A is called the generating matrix of the square-root lattice. A square-root lattice \(\Lambda \) 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 \in {{\mathbb C}^d}\), we write \(z=x+iy\), where \(x \in {{\mathbb R}^d}\) is the real part of z, and \(y \in {{\mathbb R}^d}\) is the imaginary part of z. For two functions \(v,w: {{\mathbb C}^d}\rightarrow [0,\infty )\), we write \(v \lesssim w\), if and only if there exists a positive constant \(c>0\) such that \(v(z) \le c w(z)\) for every \(z \in {{\mathbb C}^d}\).
The space of analytic functions we are dealing with will be denoted by \(\mathcal {O}_a^b({{\mathbb C}^d})\). For \(a,b \in {\mathbb R}_{>0}^d {:}{=}(0,\infty )^d\) it is defined by
where \(\mathcal {O}({\mathbb C}^d)\) denotes the space of entire functions of d complex variables. The function class \(\mathcal {O}_{a}^b({\mathbb C}^d)\) is a linear subspace of \(\mathcal {O}({{\mathbb C}^d}) \cap {L^2({\mathbb R}^d)}\) (the space of all entire functions which are square-integrable on \({{\mathbb R}^d}\)), and if \(a<b\) (i.e., \(a_j<b_j\) for every \(j \in \{ 1, \dots , d \}\)), then \(\mathcal {O}_{a}^b({\mathbb C}^d)\) is dense in \({L^2({\mathbb R}^d)}\). Note that we will repeatedly identify entire functions with their restriction on \({{\mathbb R}^d}\), and vice versa, functions on \({{\mathbb R}^d}\) with their analytic extension on \({\mathbb C}^d\) (provided the extension exists). We refer to Sect. 2.1 for a detailed discussion of properties of \(\mathcal {O}_{a}^b({\mathbb C}^d)\). Window functions which belong to the function space \(\mathcal {O}_{a}^b({\mathbb 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.
Theorem 1.1
Let \(a,b \in {\mathbb R}^d_{>0}\), and let \(0 \ne \varphi \in \mathcal {O}^a_b({\mathbb C}^d)\) be a window function. Suppose that \(\Lambda =A(\sqrt{{\mathbb Z}})^{2d}\) is a rectangular square-root lattice such that the generating matrix \(A = \textrm{diag}(\tau _1,\dots ,\tau _d,\nu _1,\dots ,\nu _d)\) with \(\tau ,\nu \in {\mathbb R}^d_{>0}\) satisfies
Then the following statements are equivalent for every \(f,h \in {L^2({\mathbb R}^d)}\):
-
(1)
\(|V_\varphi f(\lambda )| = |V_\varphi h(\lambda )|\) for every \(\lambda \in \Lambda \),
-
(2)
\(f \sim h\).
Notice that for \(\gamma > 0\) and for a suitable choice of a and b, the Gaussian \(\varphi (x)=e^{-\gamma \Vert x \Vert _2^2}, \, \Vert x \Vert _2^2 = \sum _{j=1}^d x_j^2\), is an element of \(\mathcal {O}^a_b({\mathbb C}^d)\). 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 Gaussian-type 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 \(\gamma > 0\), let \(p: {\mathbb C}^d \rightarrow {\mathbb C}\) be an entire function of exponential type, and let \(\varphi \in {L^2({\mathbb R}^d)}\) be the window function \( \varphi (x) = p(x)e^{-\gamma \Vert x \Vert _2^2}. \) If \(\alpha ,\beta > 0\) satisfy
then the following statements are equivalent for every \(f,h \in {L^2({\mathbb R}^d)}\):
-
(1)
\(|V_\varphi f(\lambda )| = |V_\varphi h(\lambda )|\) for every \(\lambda \in \alpha (\sqrt{{\mathbb Z}})^d \times \beta (\sqrt{{\mathbb Z}})^d\),
-
(2)
\(f \sim h\).
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 \(\{ \mathfrak {h}_k: k \in {\mathbb N}_0^d \} \subseteq {L^2({\mathbb R}^d)}\) is defined via tensorisation,
The prototypical example of a Hermite function is the standard Gaussian \(\mathfrak {h}_0\) which is given by \(\mathfrak {h}_0(t) = 2^{d/4} e^{-\pi \Vert t \Vert _2^2}\). Any other Hermite function is the product of \(\mathfrak {h}_0\) with a polynomial. The choice of Hermite functions as window functions implies the following concise statement.
Corollary 1.3
Let \(\mathfrak {h} \in {L^2({\mathbb R}^d)}\) be an arbitrary Hermite function. If
then the following statements are equivalent for every \(f,h \in {L^2({\mathbb R}^d)}\):
-
(1)
\(|V_\mathfrak {h} f(\lambda )| = |V_\mathfrak {h} h(\lambda )|\) for every \(\lambda \in \alpha (\sqrt{{\mathbb Z}})^{2d}\),
-
(2)
\(f \sim h\).
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 Sect. 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 et al. [5]. Consider the set \(\Lambda \subseteq {\mathbb R}^2 \simeq {\mathbb C}\) defined by
According to [5, Theorem 1], the set \(\Lambda \) is a uniqueness set for the Bargmann-Fock space \(\mathcal {F}^2({\mathbb C})\) which is defined as the collection of all entire functions \(F \in \mathcal {O}({\mathbb C})\) so that
where dA(z) denotes the Euclidean area measure on \({\mathbb C}\). The Bargmann-transform constitutes a unitary isomorphism between \(\mathcal {F}^2({\mathbb C})\) and \({L^2({\mathbb R})}\). In addition, it yields an intimate relation between the short-time Fourier transform \(V_\varphi \) with window function \(\varphi (t)=2^{1/4}e^{-\pi t^2}\) and \(\mathcal {F}^2({\mathbb C})\) [19, Section 3.4]. In view of this one-to-one correspondence, the theorem of Ascensi, Lyubarskii and Seip implies that if \(\Lambda \) is defined as in (2), then the following statements are equivalent for every \(f,h \in {L^2({\mathbb R}^d)}\):
-
(1)
\(V_\varphi f(\lambda ) = V_\varphi h(\lambda )\) for every \(\lambda \in \Lambda \),
-
(2)
\(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 \in {L^2({\mathbb R})}\).
Viazovska and Radchenko [25]. Let \(\mathcal {S}_e({\mathbb R})\) denote the space of even Schwartz functions \(f: {\mathbb R}\rightarrow {\mathbb R}\). According to [25, Corollary 1], the following two statements are equivalent for every \(f,h \in \mathcal {S}_e({\mathbb R})\):
-
(1)
\(f(\lambda )=h(\lambda )\) and \({\hat{f}}(\lambda ) = {\hat{h}}(\lambda )\) for every \(\lambda \in \sqrt{{\mathbb Z}_{\ge 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.
2 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 Sect. 1.1. The focus of study is the function space \(\mathcal {O}_{a}^b({\mathbb C}^d)\) and uniqueness sets for spaces of analytic functions.
2.1 The Function Space \(\mathcal {O}_{a}^b({\mathbb C}^d)\)
Recall that if \(a,b \in {\mathbb R}^d_{>0}\), then \(\mathcal {O}_a^b({{\mathbb C}^d})\) denotes the collection of all entire functions \(F \in \mathcal {O}({{\mathbb C}^d})\) which satisfy the estimate
Further, we define
It is evident that for every \(a \in {\mathbb R}^d_{>0}\) we have \(\mathcal {O}_{a}^b({\mathbb C}^d) \subseteq \mathcal {O}^b({\mathbb C}^d)\). The parameters a and b govern the growth and the decay of \(F \in \mathcal {O}_{a}^b({\mathbb C}^d)\): the constant b upper bounds the growth of F on \({{\mathbb C}^d}\) whilst a simultaneously lower bounds the decay rate of F on \({{\mathbb R}^d}\). It follows, that every \(F \in \mathcal {O}_{a}^b({\mathbb C}^d)\) is an entire function of order at most two in each complex variable. Recall that an entire function \(F \in \mathcal {O}({\mathbb C})\) is said to be of finite order if there exists a positive number \(c>0\) such that \( |F(z)| \lesssim e^{|z|^c}. \) The smallest non-negative number \(\rho \ge 0\) such that
for every \(\varepsilon >0\) is called the order of F. The order of a non-constant entire function F is given by the formula
where \(M(r) = \max _{z \in \partial B_r(0)} |F(z)|\) denotes the maximum-modulus function of F, and \(\partial B_r(0) {:}{=}\{ z \in {\mathbb C}: |z|=r \}\). An entire function \(G: {{\mathbb C}^d}\rightarrow {\mathbb 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 \(\sigma > 0\) such that
where \(\Vert z \Vert _1 = \sum _{j=1}^d |z_j|, \, z = (z_1,\dots ,z_d)^T \in {{\mathbb C}^d}\). The following short lemma makes an assertion about the product of an entire function of exponential type with a function in \(\mathcal {O}_a^b({{\mathbb C}^d})\). It will be of frequent use throughout the remainder of the article.
Lemma 2.1
Let \(a,b \in {\mathbb R}^d_{>0}\), let \(F \in \mathcal {O}_a^b({{\mathbb C}^d})\), and let G be an entire function of exponential type. Then for every \(\varepsilon = (\varepsilon _1, \dots , \varepsilon _d)^T \in {\mathbb R}_{>0}^d\) with \(\varepsilon _j \in (0,a_j)\) for all \(j \in \{ 1,\dots , d \}\), it holds that \(GF \in \mathcal {O}_{a-\varepsilon }^{b+\varepsilon }({{\mathbb C}^d})\).
Proof
Since G is of exponential type, there exists a positive real number \(\sigma >0\) such that
Notice that for every \(\delta >0\) there exists a constant \(C=C(\delta )>0\) such that for every \(t \in {\mathbb R}\) it holds that \(e^{\sigma |t|} \le Ce^{\delta t^2}\). Thus,
and therefore \(GF \in \mathcal {O}_{a-\varepsilon }^{b+\varepsilon }({{\mathbb C}^d}).\) \(\square \)
We proceed with the discussion of several important properties of the function class \(\mathcal {O}_{a}^b({\mathbb C}^d)\).
Proposition 2.2
Let \(a,b \in {\mathbb R}^d_{>0}\). Then the following properties hold:
-
(1)
The set \(\mathcal {O}_a^b({{\mathbb C}^d})\) is a linear subspace of \(\mathcal {O}({{\mathbb C}^d}) \cap L^2({{\mathbb R}^d})\).
-
(2)
For every \(\mathfrak {a},\mathfrak {b} \in {\mathbb R}_{>0}^d\) such that \(\mathfrak {a}_j \in (0,a_j)\) and \(\mathfrak {b}_j > b_j\) for all \(j \in \{ 1, \dots , d \}\), it holds that
$$\begin{aligned} \mathcal {O}_a^b({{\mathbb C}^d}) \subseteq \mathcal {O}_{\mathfrak {a}}^{\mathfrak {b}}({{\mathbb C}^d}). \end{aligned}$$ -
(3)
If \(a<b\), then \(\mathcal {O}_a^b({{\mathbb C}^d})\) is infinite-dimensional and dense in \({L^2({\mathbb R}^d)}\).
-
(4)
If \(a=b\), then \(\mathcal {O}_a^b({{\mathbb C}^d}) = {\mathbb C}\varphi \) where \(\varphi \in \mathcal {O}({{\mathbb C}^d})\) is the Gaussian
$$\begin{aligned}\varphi (z_1,\dots ,z_d) = \prod _{j=1}^d e^{-a_j z_j^2}.\end{aligned}$$ -
(5)
If \(a_j>b_j\) for some \(j \in \{ 1,\dots , d \}\), then \(\mathcal {O}_a^b({{\mathbb C}^d}) = \{ 0 \}\).
Proof
The property of \(\mathcal {O}_a^b({{\mathbb C}^d})\) being a linear space of entire functions follows directly from its definition. Since every \(F \in \mathcal {O}_a^b({{\mathbb C}^d})\) has Gaussian decay on \({{\mathbb R}^d}\), we further deduce the inclusion \(\mathcal {O}_a^b({{\mathbb C}^d}) \subseteq L^2({{\mathbb R}^d})\). The inclusion \(\mathcal {O}_a^b({{\mathbb C}^d}) \subseteq \mathcal {O}_{\mathfrak {a}}^{\mathfrak {b}}({{\mathbb C}^d})\) with \(\mathfrak {a},\mathfrak {b}\) defined as above follows at once from the definition of \(\mathcal {O}_a^b({{\mathbb C}^d})\). This shows the first two claims of the Proposition. To prove the third statement, suppose that \(a<b\) and define \(c {:}{=}\frac{1}{2}(a+b)\). Then for every \(j \in \{ 1,\dots , d \}\) and every \(z \in {{\mathbb C}^d}\) we have
This shows that the Gaussian \(G \in \mathcal {O}({{\mathbb C}^d})\) defined via
is an element of \(\mathcal {O}_a^b({{\mathbb C}^d})\). Now let \(p \in \mathcal {O}({{\mathbb C}^d})\) 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 \in \mathcal {O}_{c-\varepsilon }^{c+\varepsilon }({{\mathbb C}^d})\) for every \(\varepsilon = (\varepsilon _1, \dots , \varepsilon _d)^T \in {\mathbb R}_{>0}^d\) with \(\varepsilon _j \in (0,a_j)\) for all \(j \in \{ 1,\dots , d \}\). In view of Equation (3), it follows that a sufficiently small choice of \(\varepsilon _j\) implies that we have both \(c_j-\varepsilon _j > a_j\) and \(c_j + \varepsilon _j < b_j\) for every \(j \in \{1,\dots ,d \}\). Thus, the previous inclusion shows that \(pG \in \mathcal {O}_a^b({{\mathbb C}^d})\). Since p was arbitrary, every function which is a product of a polynomial with the Gaussian G is an element of \(\mathcal {O}_a^b({{\mathbb C}^d})\). In particular, \(\mathcal {O}_a^b({{\mathbb C}^d})\) contains a system of scaled Hermite functions, the span of which is known to be dense in \({L^2({\mathbb R}^d)}\). The statement follows from that. For the fourth assertion, we observe that if \(F \in \mathcal {O}_a^b({{\mathbb C}^d})\), then for every \(z \in {{\mathbb C}^d}\) it holds that
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 \(\nu \in {\mathbb C}\) such that \(F=\nu \varphi \), where \(\varphi \) is defined as in the statement of the Proposition. Hence, \(\mathcal {O}_a^b({{\mathbb C}^d}) \subseteq {\mathbb C}\varphi \). The reverse inclusion is trivial. In order to prove the last claim, we write for \(j \in \{ 1, \dots , d \}\) and for \(z \in {{\mathbb C}^d}\)
If \(d=1\), we skip the definition of \(z'\). We then have
where H is a function of \(z' \in {\mathbb C}^{d-1}\). Suppose that \(a_j>b_j\) holds for some \(j \in \{ 1,\dots , d \}\). Then, it follows from Liouville’s theorem that the map \(z_j \mapsto F(z_1,\dots , z_d)\) vanishes identically. Since \(z'\) was arbitrary, we have \(F=0\). \(\square \)
2.2 Uniqueness Sets for \(\mathcal {O}^b({\mathbb C}^d)\)
Let \(\mathcal {S} \subseteq \mathcal {O}({{\mathbb C}^d})\) be a linear space. A set \(\Lambda \subseteq {{\mathbb C}^d}\) is said to be a uniqueness set for \(\mathcal {S}\) if for every \(F \in \mathcal {S}\) it holds that
Clearly, every open set in \(\Lambda \subseteq {{\mathbb C}^d}\) is a uniqueness set for \(\mathcal {O}({{\mathbb C}^d})\). If \(\Lambda \) is contained in \({{\mathbb R}^d}\), then the following can be said [13, Lemma 3.4].
Lemma 2.3
Let \(\Lambda \subseteq {{\mathbb R}^d}\) be a Lebesgue-measurable set such that \(\mathcal {L}^d(\Lambda ) > 0\), where \(\mathcal {L}^d\) denotes the d-dimensional Lebesgue measure. Then \(\Lambda \) is a uniqueness set for \(\mathcal {O}({{\mathbb C}^d})\).
Our objective now is to establish uniqueness sets for the class \(\mathcal {O}^b({\mathbb C}^d), \, b \in {\mathbb R}^d_{>0}\), which are discrete subsets of \({{\mathbb R}^d}\). To achieve this, we introduce the zero-counting function. Given \(0< r < R\) and an analytic function F defined on the open unit ball \(B_R(0) = { z \in {\mathbb C}: |z| < R }\), we denote by n(r) the number of zeros F within the region where \(|z| \le r\) (counting multiplicities). This defines a map \(n: [0,R) \rightarrow {\mathbb 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 \in \mathcal {O}(B_R(0))\) satisfies \(F(0) \ne 0\). If \(z_1,\dots , z_n\) are the zeros of F for which \(|z_j| \le r\) (counting multiplicities), then
Utilizing Jensen’s formula, we are well-equipped to prove the following uniqueness statement.
Proposition 2.5
Let \(b = (b_1,\dots ,b_d) \in {\mathbb R}^d_{>0}\). For each \(j \in \{ 1,\dots , d \}\) let
where \(\lambda _j: {\mathbb N}_0 \rightarrow {\mathbb R}_{>0}\) is an increasing function. If
for every \(j \in \{ 1,\dots , d \}\), then \(\Lambda {:}{=}\Lambda _1 \times \dots \times \Lambda _d\) is a uniqueness set for \(\mathcal {O}^b({{\mathbb C}^d})\). If on the other hand,
for some \(j \in \{ 1,\dots , d \}\), then \(\Lambda {:}{=}\Lambda _1 \times \dots \times \Lambda _d\) is not a uniqueness set for \(\mathcal {O}^b({{\mathbb C}^d})\).
Proof
Step 1 We prove the first part of the statement via induction over the dimension \(d \in {\mathbb N}\). To this end, let \(d=1\), let \(\Lambda {:}{=}\Lambda _1\) with \(\Lambda = \{ \pm \lambda (k): k \in {\mathbb N}_0 \}\), and let \(b {:}{=}b_1\). Suppose that \(F: {\mathbb C}\rightarrow {\mathbb C}\) is an entire function which satisfies the bound \(|F(z)| \lesssim e^{b|z|^2}\). Without loss of generality we may suppose that \(F(0)=1\). For if \(F(0) \notin \{ 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 \(\overline{B_r(0)} {:}{=}\{ z \in {\mathbb C}: |z| \le r\} \subseteq {\mathbb C}\) of radius \(r>0\). Combining the assumption that \(F(0)=1\) with Jensen’s formula implies the identity
Since \(|F(z)| \le C e^{b|z|^2}\) for some constant \(C>0\), the previous equality yields the estimate
Now let \(s>1\). The property of \(t \mapsto n(t)\) being non-decreasing shows that
Assume that F vanishes on \(\Lambda {\setminus } \{ 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=\lambda (k)\) and \(s>1\) yields \(n(r) \ge 2k\) and
This in turn shows the validity of the inequality
where we used the elementary estimate \(\sqrt{p+q} \le \sqrt{p}+\sqrt{q}\) for \(p,q \ge 0\). Maximizing the left-hand side of Equation (5) with respect to \(s>1\) gives
resulting in the lower \(\liminf \)-bound
Hence, if
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 \in \Lambda _1\), the map
is an entire function of \(d-1\) complex variables which belongs to \(\mathcal {O}^{b'}({\mathbb C}^{d-1})\), where \(b' = (b_2,\dots , b_d)^T \in {\mathbb R}_{>0}^{d-1}\). This function vanishes on \(\Lambda _2 \times \dots \times \Lambda _d\). By the induction hypothesis, it must vanish identically. Now fix \((p_2,\dots , p_d) \in {\mathbb C}^{d-1}\) and consider the map
Then S is an entire function which vanishes on \(\Lambda _1\) and satisfies the bound
Therefore, it holds that \(S \in \mathcal {O}^{b_1}({\mathbb C})\). The case \(d=1\) shows that S vanishes identically and the arbitrariness of \((p_2,\dots , p_d) \in {\mathbb C}^{d-1}\) concludes the proof of the statement.
Step 2 To prove the second part of the statement, we again start with \(d=1\). Let \(\Lambda {:}{=}\Lambda _1\) with \(\Lambda = \{ \pm \lambda (k): k \in {\mathbb N}_0 \}\), and let \(b {:}{=}b_1\). Suppose that \(\liminf _{k \rightarrow \infty } \frac{\lambda (k)}{\sqrt{k}} > \sqrt{\frac{\pi }{b}}\). Let \(\varepsilon >0\) such that \(\varepsilon \in (0,b)\), and that
It follows that there exists an integer \(K \in {\mathbb N}\) such that
Define \(\gamma (k) {:}{=}\lambda (k)^2\) and \(\Gamma {:}{=}\{ \gamma (k): k \ge K \}\). The Weierstrass factorization of the hyperbolic sine is given by
The lower bound given in (6) implies that
Defining \(F(z) {:}{=}\prod _{k=K}^\infty 1 - \frac{z^2}{\gamma (k)^2}\), 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 \(\Gamma \) (in fact, it vanishes on \(\Gamma \cup (-\Gamma )\)). Now define
Then \({\tilde{F}}\) vanishes on \(\{ \pm \sqrt{\gamma (k)}: k \ge K \} \cup \{ \pm \lambda (k): k=1,\dots , K-1 \} = \Lambda \). Moreover,
which shows that \({\tilde{F}} \in \mathcal {O}^b({\mathbb C})\). Since \({\tilde{F}}\) is not the zero function, it follows that \(\Lambda \) is not a uniqueness set for \(\mathcal {O}^b({\mathbb C})\). The general statement for \(\mathcal {O}^b({{\mathbb C}^d})\) follows from the one for \(\mathcal {O}^b({\mathbb C})\): if \(\Lambda _j\) satisfies \(\liminf _{k \rightarrow \infty } \frac{\lambda _j(k)}{\sqrt{k}} > \sqrt{\frac{\pi }{b_j}}\), then there exists a non-trivial function \({\tilde{F}} \in \mathcal {O}^{b_j}({\mathbb C})\) that vanishes on \(\Lambda _j\). Consequently, the function
is non-trivial, it vanishes on \({\mathbb C}^{j-1} \times \Lambda _j \times {\mathbb C}^{d-j} \supseteq \Lambda _1 \times \cdots \times \Lambda _d\), and it belongs to \(\mathcal {O}^{b}({\mathbb C}^d)\). This yields the assertion. \(\square \)
3 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 \in [1,\infty ]\) are conjugate to each other, i.e., \(\frac{1}{p}+\frac{1}{q}=1\), and if \(v \in L^p({{\mathbb R}^d})\), \(w \in L^q({{\mathbb R}^d})\), we define
For a function \(f: {{\mathbb C}^d}\rightarrow {\mathbb C}\), the shift of f by \(\nu \in {{\mathbb C}^d}\) is defined via
and its reflection is the map
The Fourier transform of a function \(f \in L^1({{\mathbb R}^d})\) is defined by
where \(\omega \cdot t = \sum _{j=1}^d \omega _j t_j\). The extension of \({\mathcal {F}}\) from \(L^1({{\mathbb R}^d}) \cap {L^2({\mathbb R}^d)}\) to a unitary operator on \({L^2({\mathbb R}^d)}\) is carried out in the usual way. Notice that the short-time Fourier transform satisfies the identity \(V_gf(x,\omega ) = {\mathcal {F}}(f \overline{T_x g} )(\omega )\). Finally, we define for a vector \(\omega \in {{\mathbb C}^d}\) and \(f: {{\mathbb C}^d}\rightarrow {\mathbb C}\) the map \(f_\omega : {{\mathbb C}^d}\rightarrow {\mathbb C}\) by
We call \(f_\omega \) the tensor product of f. If f is assumed to be entire, then for every \(\omega \in {\mathbb C}^d\), and every \(t \in {\mathbb C}^d\), both maps
define entire functions from \({\mathbb C}^d\) to \({\mathbb 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_ff\) to the equivalence relation \(\sim \) [6, 19].
Lemma 3.1
Let \(f,h \in {L^2({\mathbb R}^d)}\) such that \(V_ff(x,\omega ) = V_hh(x,\omega )\) for every \((x,\omega ) \in {\mathbb R}^{2d}\). Then \(f \sim h\).
The second lemma pertains to parameter integrals with respect to a complex variable [21, 26].
Lemma 3.2
Let \(F: {{\mathbb R}^d}\times {\mathbb C}^d \rightarrow {\mathbb C}\) be a function subjected to the following assumptions:
-
(1)
\(F(\cdot ,z)\) is Lebesgue-measurable for every \(z \in {\mathbb C}^d\),
-
(2)
\(F(t,\cdot )\) is an entire function for every \(t \in {{\mathbb R}^d}\),
-
(3)
The function \(z \mapsto \int _{{\mathbb R}^d}|F(t,z)| \, dt\) is locally bounded, that is, for every \(z_0 \in {\mathbb C}^d\) there exists a positive constant \(\delta > 0\) such that
$$\begin{aligned} \sup _{\begin{array}{c} z \in {\mathbb C}^d \\ |z-z_0| \le \delta \end{array}} \int _{{\mathbb R}^d}|F(t,z)| \, dt < \infty . \end{aligned}$$
Then \(z \mapsto \int _{{\mathbb 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 \(\mathcal {O}_a^b({{\mathbb C}^d})\). This analysis is made under the assumption that complete spectrograms are available. The discretization step is performed in the subsequent stage.
Corollary 3.3
Let \(a,b \in {\mathbb R}_{>0}^d\), and let \(0 \ne \varphi \in \mathcal {O}_a^b({{\mathbb C}^d})\). If \(f,h \in {L^2({\mathbb R}^d)}\) are such that \(|V_\varphi f(x,\omega )| = |V_\varphi h(x,\omega )|\) for every \((x,\omega ) \in {\mathbb R}^{2d}\), then \(f \sim h\).
Proof
Consider the absolute value of the STFT of a function \(f \in {L^2({\mathbb R}^d)}\) with respect to the window function \(\varphi \) in the second argument, i.e., the map \(\omega \mapsto |V_\varphi f(x,\omega )|^2\) for some fixed \(x \in {{\mathbb R}^d}\). Using the definition of the STFT as the Fourier transform of the product of f with a shift of \(\varphi \) yields the identity
The convolution \(\mathcal {R} (f\overline{T_x\varphi }) * ({\overline{f}}T_x\varphi )\) evaluated at \(s \in {{\mathbb R}^d}\) is given by
Combining Equation (7) with Equation (8) shows that the spectrogram satisfies the identity
Hence, if \(h \in {L^2({\mathbb R}^d)}\) is such that \(|V_\varphi f| = |V_\varphi h|\), then
It follows, that for every fixed \(\omega \in {{\mathbb R}^d}\), the map
vanishes identically. Applying the Fourier transform to \(Q_\omega \) yields the relation
which holds for every \(x \in {{\mathbb R}^d}\). Observe that the function \(\mathcal {R}(\varphi _\omega )\) has Gaussian decay and since \(\varphi \ne 0\) it does not vanish identically. Applying Lemma 3.2, shows that the map \(x \mapsto {\mathcal {F}}(\mathcal {R}(\varphi _\omega ))(x)\) extends from \({{\mathbb R}^d}\) to an entire function which does not vanish identically. In particular, the set
has d-dimensional Lebesgue measure zero (cf. Lemma 2.3). Since \({\mathcal {F}}(f_\omega - h_\omega )\) is continuous, it follows that \({\mathcal {F}}(f_\omega - h_\omega )\) must vanish identically. The arbitrariness of \(\omega \in {{\mathbb R}^d}\) shows that \({\mathcal {F}}(f_\omega - h_\omega )\) vanishes identically for every \(\omega \in {{\mathbb R}^d}\). In other words,
for every \((\omega ,y)\in {\mathbb R}^{2d}\). The statement follows from Lemma 3.1. \(\square \)
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_\varphi f|^2\), extends from \({\mathbb R}^{2d}\) to an entire function belonging to \(\mathcal {O}^c({\mathbb C}^{2d})\), provided that \(\varphi \in \mathcal {O}_a^b({{\mathbb C}^d})\). The constant \(c \in {\mathbb R}_{>0}^{2d}\) is expressed in terms of a and b.
Lemma 3.4
Let \(a,b \in {\mathbb R}_{>0}^d\), let \(\varphi \in \mathcal {O}_a^b({{\mathbb C}^d})\), and let
Then for every \(f \in {L^2({\mathbb R}^d)}\), it holds that \(|V_\varphi f|^2 \in \mathcal {O}^c({\mathbb C}^{2d})\), i.e, \(|V_\varphi f|^2\) extends from \({\mathbb R}^{2d}\) to an entire functions belonging to the space \(\mathcal {O}^c({\mathbb C}^{2d})\).
Proof
Step 1. Let \(z = x+i\rho \in {\mathbb C}^d\) with \(x,\rho \in {\mathbb R}^d\) and consider the modulus of a complex shift of \(\varphi _t\) by z, i.e., the map \(|T_{z} \varphi _t|\). Employing the definition of the class \(\mathcal {O}_a^b({\mathbb C}^d)\) yields the estimate
The modulus of the inner product of an arbitrary function \(u \in L^1({{\mathbb R}^d})\) with a complex shift of \(\varphi _t\) by \(z = x+i\rho \) is therefore upper bounded by
Now replace in the previous estimate the function u by the tensor product \(f_t\) where \(f \in {L^2({\mathbb R}^d)}\). The Cauchy-Schwarz inequality shows that
Consider the Fourier integral
For \(z=v+i\delta \in {\mathbb C}^d\) with \(v,\delta \in {\mathbb R}^d\), the Fourier integral F satisfies the estimate
for some constant C(a) depending only on a. Moreover, an application of Lemma 3.2 shows that F defines an entire function on \({\mathbb 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,\omega ) \in {\mathbb R}^{2d}\). According to Step 1, the function F extends from \({\mathbb R}^{2d}\) to an entire function of 2d complex variables and satisfies the growth estimate
This implies that for \(c \in {\mathbb R}_{>0}^{2d}\) given as in Equation (10), we have \(|V_\varphi f|^2 \in \mathcal {O}^c({\mathbb C}^{2d})\). \(\square \)
We are ready to proof Theorem 1.1 from Sect. 1.1.
Proof of Theorem 1.1
The fact that (2) implies (1) is trivial. It remains to show that (1) implies (2). To this end, define \(\Psi {:}{=}M(\sqrt{{\mathbb Z}})^d\) and \(\Gamma {:}{=}N(\sqrt{{\mathbb Z}})^d\) with \(M = \textrm{diag}(\tau _1,\dots , \tau _d)\) and \(N = \textrm{diag}(\nu _1,\dots , \nu _d)\), so that \(\Lambda = \Psi \times \Gamma \). The choice of \(\tau \) and \(\nu \), in conjunction with Proposition 2.5 implies that \(\Lambda \) is a uniqueness set for the space \(\mathcal {O}^c({\mathbb C}^{2d})\) with
Let \(f,h \in {L^2({\mathbb R})}\), such that
or, equivalently,
According to Lemma 3.4, it holds that \(|V_\varphi f|^2 \in \mathcal {O}^c({\mathbb C}^{2d})\) and \(|V_\varphi h|^2 \in \mathcal {O}^c({\mathbb C}^{2d})\). Since \(\Lambda \) is a uniqueness set for \(\mathcal {O}^c({\mathbb C}^{2d})\), it follows that \(|V_\varphi f|^2 = |V_\varphi h|^2\), i.e., the spectrograms of f and h with respect to the window function \(\varphi \), agree everywhere on \({{\mathbb R}^d}\). Corollary 3.3 implies that \(f \sim h\). \(\square \)
With the proof of Theorem 1.1 now established, we can seamlessly proceed to derive the proof for Corollary 1.2.
Proof of Corollary 1.2
The map \(x \mapsto e^{-\gamma \Vert x \Vert _2^2}\) is the restriction to \({{\mathbb R}^d}\) of the entire function \(F(z) = \prod _{j=1}^d e^{-\gamma z_j^2}\). Defining
it follows that \(F \in \mathcal {O}_{{\tilde{\gamma }}}^{{\tilde{\gamma }}}({{\mathbb C}^d})\) (cf. Proposition 2.2(4)). Since p is of exponential type, Lemma 2.1 shows that \(pF \in \mathcal {O}_{{\tilde{\gamma }}-{\tilde{\varepsilon }}}^{{\tilde{\gamma }} + {\tilde{\varepsilon }}}({{\mathbb C}^d})\) whenever \({\tilde{\varepsilon }}\) is of the form
for some \(\varepsilon \in (0,\gamma )\). For a sufficiently small choice of \(\varepsilon \), the assumptions on \(\alpha \) and \(\beta \) imply that
The statement therefore follows from Theorem 1.1. \(\square \)
Notice that Corollary 1.3 follows at once from Corollary 1.2 simply by the choice \(\gamma =\pi \) and the fact that every polynomial is an entire function of exponential type.
4 Beyond Diagonal Generating Matrices
We aim to extend the results of Sect. 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 \in {\mathbb R}^{2d \times 2d}\) is called symplectic if \(S^T \mathcal {J}S = \mathcal {J}\) where \(\mathcal {J}\) denotes the standard symplectic matrix
and \(I_d\) denotes the identity matrix in \({\mathbb R}^{d \times d}\). The collection of all symplectic matrices in \({\mathbb R}^{2d \times 2d}\) is called the symplectic group and is denoted by \(\textrm{Sp}(2d,{\mathbb R})\). If \(d=1\), then \(\textrm{Sp}(2d,{\mathbb R}) = \textrm{Sp}(2,{\mathbb R}) = \textrm{SL}(2,{\mathbb R})\), the special linear group in \({\mathbb R}^{2 \times 2}\). The metaplectic group \(\textrm{Mp}(d)\) is the unitary representation of the double cover of the symplectic group \(\textrm{Sp}(2d,{\mathbb R})\) on \({L^2({\mathbb R}^d)}\). Briefly speaking, to every symplectic matrix \(S \in \textrm{Sp}(2d,{\mathbb R})\) corresponds a unitary operator \({{\hat{S}}}: {L^2({\mathbb R}^d)}\rightarrow {L^2({\mathbb R}^d)}\) (defined up to a sign factor), that satisfies the relation
for every \(f, g \in {L^2({\mathbb R}^d)}, \, S \in \textrm{Sp}(2d,{\mathbb R})\) and \((x,\omega ) \in {\mathbb 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].
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. A general uniqueness result for sampling on square-root lattices reads as follows.
Theorem 4.1
Let \(S \in \textrm{SL}_2({\mathbb R})\) and \(p,q > 0\) be given by
If \(p-q>0\) and if
then the following statements are equivalent for every \(f,h \in {L^2({\mathbb R})}\):
-
(1)
\(|V_\varphi f(\lambda )| = |V_\varphi h(\lambda )|\) for every \(\lambda \in \alpha S (\sqrt{{\mathbb Z}})^{2}\),
-
(2)
\(f \sim h\).
Proof
Since \(S \in \textrm{SL}_2({\mathbb R})\), it follows that the condition
is equivalent to
According to [8, Proposition 252], there exists a constant \(C \in {\mathbb C}{\setminus } \{ 0 \}\) such that \( {{\hat{S}}} \varphi (t) = Ce^{-\pi c t^2}, \) where
Thus, for \(x,y \in {\mathbb R}\) we have
Using Young’s inequality we obtain the bound
This shows that \({{\hat{S}}} \varphi \in \mathcal {O}^{\pi (p+q)}_{\pi (p-q)}({\mathbb C})\). Combining Theorem 1.1 with condition (14) and identity (15), implies that \({{\hat{S}}} f \sim {{\hat{S}}} h\). Since the equivalence relation "\(\sim \)" is invariant under applications of invertible linear operators, it follows that \(f \sim h\). \(\square \)
The latter theorem provides a uniqueness statement for the STFT phase retrieval problem via sampling on lattices that are deformed under the action of a matrix in \(\textrm{SL}(2,{\mathbb R})\). For instance, it covers the important class of rotation matrices and shear matrices.
Example 4.2
(Rotated square-root lattices) Consider the rotation matrix \(R_\theta \in {\mathbb R}^{2 \times 2}, \, \theta \in {\mathbb R}\), given by
Then \(R_\theta \in \textrm{SL}(2,{\mathbb R})\) and the corresponding metaplectic operator \(\widehat{R_\theta }\) is the so-called fractional Fourier transform of order \(\theta \) [9, 22]. For \(S=R_\theta \), the constants p and q in Theorem 4.1 satisfy \(p=1\) and \(q=0\). Thus, for every \(\theta \in {\mathbb R}\), every \(0< \alpha < \sqrt{\tfrac{1}{2\pi e}}\), and every \(f,h \in {L^2({\mathbb R})}\) the following statements are equivalent:
-
(1)
\(|V_\varphi f(\lambda )| = |V_\varphi h(\lambda )|\) for every \(\lambda \in \alpha R_\theta (\sqrt{{\mathbb Z}})^{2}\),
-
(2)
\(f \sim h\).
We notice, that the previous equivalence is valid if \(\varphi \) gets replaced by an arbitrary Hermite basis function. This follows from the fact, that Hermite functions are eigenfunctions for the Fractional Fourier transform corresponding to an eigenvalue \(\nu \in {\mathbb T}\) [20, 22].
Example 4.3
(Sheared square-root lattices) Let \(\sigma \in {\mathbb R}\), and let \(A_\sigma \in \textrm{SL}_2({\mathbb R})\) be given by
Then \(A_\sigma \) is a shear parallel to the x-axis. In this case, the values p and q of Theorem 4.1 are given by
It holds that \(p-q > 0\) if and only if \(\sigma \in (-r,r)\) where \(r \approx 0.68\). For such \(\sigma \), Theorem 4.1 shows uniqueness of the STFT phase retrieval problem with Gaussian window \(\varphi (t)=e^{-\pi t^2}\) via sampling on a square root lattice generated by the shear matrix \(\alpha A_\sigma \) where \(\alpha >0\) satisfies (14). Such a square-root lattice is depicted in Fig. 2 for \(\sigma =\frac{1}{2}\).
We end the paper with several remarks regarding comparisons to related work and applications.
Remark 4.4
(Analyticity of the short-time Fourier transform) Let g be a window function and let \(V_gf(x,\omega )\) be the STFT of f with respect to g, evaluated at \((x,\omega ) \in {\mathbb R}^{2d}\). For simplicity we assume in this remark that \(d=1\). If we write \(z=x+i\omega \in {\mathbb C}\), then the STFT gives rise to the map
If g is a Gaussian window function, then, modulo a multiplication by a non-zero 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_gf\) 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, \(\mathcal {O}_a^b({{\mathbb C}^d})\) is dense in \({L^2({\mathbb 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 \in {L^2({\mathbb R}^d)}\) is determined up to a global phase by its phaseless STFT samples located on a separable square-root lattice. For precisely this choice of a window function, it is shown in [16], that ordinary separable lattices (\(\Lambda = \alpha {\mathbb Z}^d \times \beta {\mathbb Z}^d\)) yield uniqueness in classes of compactly supported functions. Specifically, if \(K \subseteq {{\mathbb R}^d}\) is a compact set and \(\varphi \) is chosen as in Corollary 1.2, then there exist \(\alpha ,\beta >0\) such that the following two statements are equivalent for every \(f,h \in L^2(K)\) (we stress the support constraint on f and h):
-
(1)
\(|V_\varphi f(\lambda )| = |V_\varphi h(\lambda )|\) for every \(\lambda \in \alpha {\mathbb Z}^d \times \beta {\mathbb Z}^d\),
-
(2)
\(f \sim 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({\mathbb 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 time-frequency plane \({\mathbb 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.
References
R. Alaifari, I. Daubechies, P. Grohs, and R. Yin. Stable Phase Retrieval in Infinite Dimensions. Found. Comput. Math., 19:869–900, 2019.
R. Alaifari and P. Grohs. Gabor phase retrieval is severely ill-posed. Appl. Comput. Harmon. Anal., 50:401–419, 2021.
R. Alaifari and M. Wellershoff. Phase retrieval from sampled Gabor transform magnitudes: Counterexamples. J. Fourier Anal. Appl., 28(1):9, Dec 2021.
G. Ascensi and J. Bruna. Model Space Results for the Gabor and Wavelet Transforms. IEEE Trans. Inform. Theory, 55(5):2250–2259, 2009.
G. Ascensi, Y. Lyubarskii, and K. Seip. Phase space distribution of Gabor expansions. Appl. Comput. Harmon. Anal., 26(2):277–282, 2009.
L. Auslander and R. Tolimieri. Radar Ambiguity Functions and Group Theory. SIAM J. Math. Anal., 16(3):577–601, 1985.
J. C. da Silva and A. Menzel. Elementary signals in ptychography. Opt. Express, 23(26):33812–33821, 2015.
M. A. de Gosson. Symplectic Methods in Harmonic Analysis and in Mathematical Physics. Birkhäuser Basel, 2011.
M. A. de Gosson and F. Luef. Metaplectic group, symplectic cayley transform, and fractional fourier transforms. J. Math. Anal. Appl., 416(2):947–968, 2014.
G. B. Folland. Harmonic Analysis in Phase Space. (AM-122). Princeton University Press, 2016.
P. Grohs and L. Liehr. On Foundational Discretization Barriers in STFT Phase Retrieval. J. Fourier Anal. Appl., 28(39), 2022.
P. Grohs and L. Liehr. Injectivity of Gabor phase retrieval from lattice measurements. Appl. Comput. Harmon. Anal., 62:173–193, 2023.
P. Grohs and L. Liehr. Non-uniqueness theory in sampled STFT phase retrieval. SIAM J. Math. Anal., 55:4695–4726, 2023.
P. Grohs and L. Liehr. Stable Gabor phase retrieval in Gaussian shift-invariant spaces via biorthogonality. Constr. Approx., 2023.
P. Grohs, L. Liehr, and M. Rathmair. Multi-window STFT phase retrieval: lattice uniqueness. arXiv:2207.10620, 2022.
P. Grohs, L. Liehr, and I. Shafkulovska. From completeness of discrete translates to phaseless sampling of the short-time Fourier transform. arXiv:2211.05687, 2022.
P. Grohs and M. Rathmair. Stable Gabor Phase Retrieval and Spectral Clustering. Comm. Pure Appl. Math., 72(5):981–1043, 2019.
P. Grohs and M. Rathmair. Stable Gabor phase retrieval for multivariate functions. J. Eur. Math. Soc. (JEMS), 2021.
K. Gröchenig. Foundations of Time-Frequency Analysis. Birkhäuser Basel, 2001.
P. Jaming. Uniqueness results in an extension of Pauli’s phase retrieval problem. Appl. Comput. Harmon. Anal., 37(3):413–441, 2014.
L. Mattner. Complex differentiation under the integral. Nieuw Archief voor Wiskunde, 5(2):32–35, 2001.
V. Namias. The Fractional Order Fourier Transform and its Application to Quantum Mechanics. IMA J. Appl. Math., 25(3):241–265, 03 1980.
A. Orlowski and H. Paul. Phase retrieval in quantum mechanics. Phys. Rev. A, 50:R921–R924, Aug 1994.
Z. Pr\(\mathring{{{\rm u}}}\)ša and N. Holighaus. Phase vocoder done right. In 2017 25th European Signal Processing Conference (EUSIPCO), pages 976–980. IEEE, 2017.
D. Radchenko and M. Viazovska. Fourier interpolation on the real line. Publ. Math. Inst. Hautes Études Sci., 129(1):51–81, 2019.
T. Swiatkowski. On the holomorphism of the integral with respect to a complex parameter. Colloq. Math., 16:61–65, 1967.
R. Young. An Introduction to Non-Harmonic Fourier Series. Academic Press, revised edition, 2001.
L. e. a. Zhou, J. Song, J. S. Kim, X. Pei, C. Huang, M. Boyce, L. Mendonça, D. Clare, A. Siebert, C. S. Allen, E. Liberti, D. Stuart, X. Pan, P. D. Nellist, P. Zhang, A. I. Kirkland, and P. Wang. Low-dose phase retrieval of biological specimens using cryo-electron ptychography. Nat. Commun., 11(1):2773, Jun 2020.
Acknowledgements
The authors highly appreciate the valuable comments made by the reviewers.
Funding
Open access funding provided by University of Vienna.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Joan Bruna.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Grohs, P., Liehr, L. Phaseless Sampling on Square-Root Lattices. Found Comput Math (2024). https://doi.org/10.1007/s10208-024-09640-3
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10208-024-09640-3