REVIEW 4 major objections 3 minor 45 references
Uniqueness of phase retrieval from offset linear canonical transform
T0 review · 4 major / 3 minor · reviewed 2026-08-07 · deepseek-v4-flash
Pith's one-line read Compactly supported signals are determined up to a global phase by the magnitudes of their offset linear canonical transforms over a positive-measure family of parameters, with analogous uniqueness for discrete, nonseparable, and…
desk verdict Genuine but sloppy OLCT phase retrieval results: the core ideas are right, but Theorem 3.4's statement is malformed and Lemma 5.1's proof has a false equality, so the STOLCT half is unverifiable until repaired. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the ambiguity function $A_f(\tau,\eta)=\int f(t+\tau/2)\overline{f(t-\tau/2)}e^{-it\eta}\,dt$, the two-dimensional correlation of a signal with itself that jointly records time and frequency shifts. The paper's central identity is Lemma 3.3, which shows that applying the OLCT merely re-parameterizes and phase-modulates this function, so a one-dimensional intensity measurement $|O_A f|^2$ exposes a one-dimensional slice of $A_f$ through equation (17). A second identity, Lemma 5.1, writes the Fourier transform of the STOLCT spectrogram as a product of the signal's and window's ambiguity functions, $F(|V_\varphi^A f|^2)(u,-v)=e^{jy_0 v}A_{\tilde f}(bv,u)A_\varphi(bv,u)$; this is what lets the window's nonvanishing ambiguity slices be cancelled, leaving the signal's ambiguity function. Analytic continuation via the Paley-Wiener theorem then converts equality on positive-measure slices into equality of the full ambiguity function, which is equivalent to equality up to a global phase.
What would settle it
Compute, for a compactly supported test signal $f$ and a fixed OLCT parameter matrix $A$, both sides of equation (17): take the Fourier transform of $|O_A f|^2$ and compare it with the slice $e^{-j\eta(y_0+\frac12 ab\eta)}A_f(-b\eta,a\eta)$ of the ambiguity function. Any systematic disagreement would falsify Lemma 3.3 and collapse the proof of Theorem 3.4; conversely, agreement on a battery of random compactly supported signals would confirm the identity the argument rests on.
Extended reading notes
Core claim
The central claim, made on the paper's own terms, is that phase retrieval in the OLCT domain is governed by the ambiguity function, not by the transform itself. Lemma 3.3 computes the ambiguity function of an OLCT-transformed signal: $A(O_A f, O_A g)(\tau,\eta) = e^{j[\tau\omega_0-\eta y_0+\frac12(d\tau-b\eta)(a\eta-c\tau)]} A(f,g)(d\tau-b\eta, a\eta-c\tau)$. Specializing to $f=g$ and $\tau=0$ gives $e^{-j\eta(y_0+\frac12 ab\eta)} A_f(-b\eta,a\eta) = \mathcal{F}(|O_A f|^2)(\eta)$, so the Fourier transform of the measured intensity is exactly one slanted slice of the signal's ambiguity function. When the ratios $a/b$ range over a positive-measure set, these slices fill a positive-measure set in the second variable for every first variable; compact support makes the ambiguity function analytic in that second variable, so the Paley-Wiener theorem extends equality of slices to equality of the whole ambiguity function. Because $A_f = A_g$ forces $g=\lambda f$ with $|\lambda|=1$, the signal is recovered up to global phase. The same slice-viewpoint, through the short-time identity in Lemma 5.1, yields the STOLCT uniqueness theorems.
Load-bearing premise
The main multiple-measurement theorem stands on the assumption that the measurement parameters cover a positive-measure set of ratios $a/b$, so the observed ambiguity-function slices have positive length; the theorem as printed describes its parameter set inconsistently, and if only a zero-measure set of ratios is intended, the analytic-continuation step collapses.
Editorial extensions
If this is right
- Compactly supported signals can be recovered up to a global phase from OLCT magnitude measurements over a positive-measure family of parameters, so intensity-only OLCT data carry no hidden ambiguity beyond the global phase.
- The convolution characterization (Theorem 3.2) says any two compactly supported signals with identical OLCT magnitudes differ by a chirp-modulated convolution of a common pair, with one factor reflected and shifted; this makes the ambiguity set explicit and testable.
- Finite-support discrete signals satisfy the analogous convolution description, so discrete OLCT phase retrieval has the same ambiguity structure as one-dimensional Fourier phase retrieval.
- Under a mild window condition, nonseparable real-valued signals are determined up to sign by STOLCT magnitudes, and complex-valued signals up to global phase when the window's ambiguity function vanishes nowhere.
- FT-bandlimited and OLCT-bandlimited signals are determined up to a global phase by sampled STOLCT magnitudes at Shannon-type sampling rates, so sampled intensity data suffice for these signal classes.
Reading between the lines
- This reader's inference: the same slice-of-ambiguity mechanism suggests a practical test for whether any finite set of OLCT parameters determines a given signal class, namely whether the corresponding slices of the ambiguity function cover, for each time lag, a set with an accumulation point in the frequency variable.
- This reader's inference: the convolution ambiguity description could be read as saying the 'trivial' ambiguities (global phase, shift, conjugate reflection) are exactly the cases where one convolution factor is a chirp-modulated delta; making this explicit might simplify algorithm design, though the paper does not pursue it.
- This reader's inference: since the STOLCT uniqueness proofs require the window's ambiguity function to be nonvanishing on specific slices, checking the condition for a candidate window reduces to computing one or two one-dimensional slices, a cheap numerical pre-check for experimental setups that the paper does not run.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This paper studies uniqueness in phase retrieval from magnitude-only measurements of the offset linear canonical transform (OLCT). It proves that nontrivial ambiguities in continuous and discrete OLCT phase retrieval can be characterized via convolution factorizations, that compactly supported continuous signals are determined up to global phase by magnitude measurements over a positive-measure family of OLCT parameters, and that nonseparable or bandlimited signals can be uniquely recovered from short-time OLCT (STOLCT) magnitude measurements under conditions on the window's ambiguity function. The arguments proceed primarily by transferring known Fourier/LCT phase retrieval results through the exact identities (5), (6), and (10).
Significance. If the proofs are correct, the paper would provide a useful extension of known phase retrieval uniqueness results to the five-parameter OLCT framework, covering continuous, discrete, and short-time settings. The use of explicit transform identities to reduce OLCT problems to Fourier or LCT problems is natural and the claimed results are plausible. The paper also gives a concrete family of uniqueness conditions in terms of the window's ambiguity function. However, the printed proofs contain several load-bearing gaps and incorrect equalities, particularly in Theorem 3.4 and Lemma 5.1, so the significance of the contribution cannot be fully assessed until those issues are resolved.
major comments (4)
- [Section 3.2, Theorem 3.4 statement] The statement of Theorem 3.4 is internally inconsistent as printed. The first sentence declares 'Λ ⊂ R is a set with positive measure', while the next line defines Λ as a set of OLCT parameter matrices by 'Λ = {a/b ∈ Λ, b>0, ad−bc=1, ...}'. These two uses of Λ cannot both hold. Under the literal wording, the hypothesis '|OA f| = |OA g| holds for all A ∈ Λ' is undefined. The theorem should be restated unambiguously, for example by letting the family of matrices have ratios a/b ranging over a positive-measure subset of R.
- [Section 3.2, Theorem 3.4 proof, following Eq. (17)] The proof asserts that for every τ ∈ R the set Λτ = {−a/b τ : A ∈ Λ} has positive measure, and then applies a Paley—Wiener extension in the second variable. This is valid for τ ≠ 0, but for τ = 0 the set Λτ collapses to {0}, which has measure zero, so the extension argument gives no information on the slice τ = 0. Since the final invocation of (15) requires equality of the entire ambiguity functions, including on τ = 0, an additional continuity argument in τ is needed to bridge from τ ≠ 0 to τ = 0. This step is not supplied, and therefore Theorem 3.4 is not established as written.
- [Section 5, Lemma 5.1 proof, Eqs. (20)–(22)] The proof contains the false equality F(fv)(u) = F(fv^sharp)(u), where fv^sharp(t) = fv(−t). For a general complex-valued fv, one has F(fv^sharp)(u) = F(fv)(−u), which is not equal to F(fv)(u). Consequently the product identity in (22) and the first equality in (19) are not derived correctly. Since Theorems 5.3–5.6 all rely on Lemma 5.1, the STOLCT uniqueness results are not supported by the printed proof. The identity itself may be salvageable through a correct manipulation of conjugate-reversal, but the present argument is invalid.
- [Section 5.2, Theorem 5.5 proof, Eqs. (26)–(27)] In Eq. (26) the complex conjugate on the second Vφ term is missing, and the line 'F^{-1}(f^sharp) = F^{-1}f' with f^sharp(t) = f(−t) is also false in general. These errors affect the derivation of (27) and hence the claimed bandlimitedness of |V_A φ f(·,u)|^2. While the intended convolution formula can likely be repaired using the conjugate of the reversed function, the printed proof does not justify the conclusion.
minor comments (3)
- [Abstract and text] There are several typographical errors: 'demenstrate' in the abstract, 'resluts' in Section 5.2, 'lase step' after Eq. (22), and 'Form Proposition 2.3' in the proof of Theorem 5.6 should read 'From Proposition 2.3'.
- [Section 5.1, definition of separability] The definition of a separable function as f = f1 + f2 with f1 f2 = 0 relies on pointwise multiplication of L2 functions; it should be stated as equality almost everywhere or in terms of disjoint supports to be fully rigorous.
- [Sections 3.2 and 5.1, black-box citations] The proofs of Theorems 3.2 and 5.4 refer to 'following the proof process of [26, Theorem 3.2]' and 'a similar procedure for the proof of [34, Theorem 3.1]' without sketching the key steps. Given that these steps are central to the uniqueness claims, the paper would benefit from at least a brief indication of how the cited arguments apply to the OLCT setting.
Circularity Check
No circular derivation found; the results are proved from explicit OLCT/FT identities and external theorems, with only minor non-load-bearing definitional self-citations.
full rationale
No specific circular reduction can be exhibited. The main results (Theorems 3.2, 3.4, 4.2, 5.3, 5.4, 5.5, 5.6) are obtained by chaining explicit OLCT-FT identities (Eqs. (5), (6), (10)), ambiguity-function identities (Lemmas 3.3 and 5.1), and external theorems cited from the literature: the Paley-Wiener theorem [44], Shannon's sampling theorem [43], Jaming's ambiguity-function uniqueness result [28], Beinert-Plonka's discrete Fourier phase-retrieval characterization [45], and the nonseparability criterion of Chen-Cheng [46]. For example, Theorem 3.4 reduces the hypothesis |O_A f| = |O_A g| to equality of ambiguity functions on the sets Lambda_tau via Eq. (17), then invokes Paley-Wiener analytic continuation and the external equivalence (15); neither step assumes the desired conclusion, and no parameter is fitted. The only self-citations, [38,39], support Definition 2.1 and the inverse OLCT formula; these are definitional facts and are not load-bearing for the uniqueness claims. There is a correctness gap in Theorem 3.4 as printed: Lambda is simultaneously declared to be a subset of R and a set of OLCT parameter matrices, and the proof does not explicitly justify the tau=0 slice needed to conclude A_f = A_g on the entire ambiguity domain. That is a rigor defect, not circularity. The score 2 reflects the presence of minor non-load-bearing definitional self-citations; the central claims retain independent mathematical content.
Assumptions & free parameters
assumptions (6)
- standard math Fourier phase retrieval ambiguity characterization: any pair with equal Fourier magnitudes factors as f=h1*h2 and g=e^{j beta}(h1(.-t0)*h2(-.))
- standard math Ambiguity function uniqueness: Af=Ag implies g=lambda f with |lambda|=1, equation (15), cited to [28]
- standard math Paley-Wiener theorem and Shannon sampling for bandlimited functions, Proposition 2.3, references [43,44]
- standard math Nonseparable real-valued continuous functions are uniquely determined by their magnitudes up to sign, Proposition 5.2, reference [46]
- standard math Lemma 2.4 from [32]: ambiguity functions of bandlimited functions are uniformly continuous and supported in R times [-2 Omega, 2 Omega]
- domain assumption Restriction to b>0 for OLCT
Cite this review
Pith. "Pith review of Uniqueness of phase retrieval from offset linear canonical transform." pith.science (2026). https://pith.science/paper/DAXV7W55
@misc{pith2026250603944,
author = {Pith},
title = {Pith review of: Uniqueness of phase retrieval from offset linear canonical transform},
year = {2026},
howpublished = {\url{https://pith.science/paper/DAXV7W55}},
note = {Machine review of arXiv:2506.03944}
}
read the original abstract
The classical phase retrieval refers to the recovery of an unknown signal from its Fourier magnitudes, which is widely used in fields such as quantum mechanics, signal processing, optics, etc. The offset linear canonical transform (OLCT), which is a more general type of linear integral transform including Fourier transform (FT), fractional Fourier transform (FrFT), and linear canonical transform (LCT) as its special cases. Hence, in this paper, we focus on the uniqueness problem of phase retrieval in the framework of OLCT. First, we prove that all the nontrivial ambiguities in continuous OLCT phase retrieval can be represented by convolution operators, and demonstrate that a continuous compactly supported signal can be uniquely determined up to a global phase from its multiple magnitude-only OLCT measurements. Moreover, we investigate the nontrivial ambiguities in the discrete OLCT phase retrieval case. Furthermore, we demenstrate that a nonseparable function can be uniquely recovered from its magnitudes of short-time OLCT (STOLCT) up to a global phase. Finally, we show that signals which are bandlimited in FT or OLCT domain can be reconstructed from its sampled STOLCT magnitude measurements, up to a global phase, providing the ambiguity function of window function satisfies some mild conditions.
Reference graph
Works this paper leans on
-
[32]
R. Alaifari, M. Wellershoff. Uniqueness of STFT phase retrieval for bandlimited functions. Appl. Comput. Harmon. Anal. , 50:34–48, 2021
work page 2021
-
[34]
R. Li, Q. Zhang. Uniqueness of phase retrieval with short-time linear canonical transform. Anal. Appl., 22(7):1–13, 2024. 20
work page 2024
-
[1]
A. Banderia, J. Cahill, D. Mixon, et al. Saving phase: Injectivity and stability for phase retrieval. Appl. Comput. Harmon. Anal. , 37(1):106–125, 2014
work page 2014
- [2]
-
[3]
R. Balan, P.G. Casazza, D. Edidin. On signal reconstruction without phase. Appl. Comput. Harmon. Anal. , 20(3):345–356, 2006
work page 2006
-
[4]
T. Chen, W. Sun. Linear phaseless retrieval of functions in spline spaces with arbitrary knots. IEEE Trans. Inform. Theory. , 68(2):1385–1396, 2021. 18
work page 2021
-
[5]
T. Qian, L. Tan. Backward shift invariant subspaces with applications to band preserving and phase retrieval problems. Math. Meth. Appl. Sci. , 39(6): 1591– 1598, 2016
work page 2016
-
[6]
B. Seifert, H. Stolz. Nontrivial ambiguities for blind frequency-resolved optical gating and the problem of uniqueness. JOSA B , 21(5):1089–1097, 2004
work page 2004
Show all 45 references
-
[7]
Bruck, L.G
Yu.M. Bruck, L.G. Sodin. On the ambiguity of the image reconstruction prob- lem. Opt. Commun., 30(3):304–308, 1979
1979
-
[8]
R.P. Millane. Phase retrieval in crystallography and optics. JOSA A, 7(3):394– 411, 1990
1990
-
[9]
Cand` es, T
E.J. Cand` es, T. Strohmer, V. Voroninski. Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming. Commun. Pure Appl. Math. , 66(8):1241–1274, 2013
2013
-
[10]
Carney, V.A
P.S. Carney, V.A. Markel, J.C. Schotland. Near-field tomography without phase retrieval. Phys. Review Lett. , 86(26):5874–5877, 2001
2001
-
[11]
H. Li, S. Li. Phase retrieval from Fourier measurements with masks. Inverse Probl. Imag., 15(5):1051–1075, 2021
2021
-
[12]
M. V. Klibanov, V. G. Kamburg. Uniqueness of a one-dimensional phase re- trieval problem. Inverse Probl., 30(7):075004, 2014
2014
-
[13]
Alaifari, I
R. Alaifari, I. Daubechies, P. Grohs, et al. Stable phase retrieval in infinite dimensions. Found. Comput. Math. , 19(4):869–900, 2019
2019
-
[15]
Y. Chen, C. Cheng, Q. Sun. Phase retrieval of complex and vector-valued func- tions. J. Funct. Anal. , 283(7):109593, 2022
2022
-
[16]
Shechtman, Y.C
Y. Shechtman, Y.C. Eldar, O. Cohen, et al. Phase retrieval with application to optical imaging: A contemporary overview. IEEE Signal Process. Mag. , 32(3):87–109, 2015
2015
-
[17]
Abe, J.T
S. Abe, J.T. Sheridan. Optical operations on wave functions as the Abelian subgroups of the special affine Fourier transformation. Opt. Lett., 19(22):1801– 1803, 1994
1994
-
[18]
L.B. Almeida. The fractional Fourier transform and time-frequency represen- tations. IEEE Trans. Signal Process., 42(11):3084–3091, 1994
1994
-
[19]
Barshan, M.A
B. Barshan, M.A. Kutay. Optimal filtering with linear canonical transforma- tions. Opt. Commun. , 135(1):32–36, 1997. 19
1997
-
[20]
R. Beinert. One-dimensional phase retrieval with additional interference inten- sity measurements. Results Math., 72(1–2):1–24, 2017
2017
-
[21]
Carmeli, T
C. Carmeli, T. Heinosaari, J. Schultz, et al. Nonuniqueness of phase retrieval for three fractional Fourier transforms. Appl. Comput. Harmon. Anal. , 39(2): 339-346, 2015
2015
-
[22]
Andreys, P
S. Andreys, P. Jaming. Zak transform and non-uniqueness in an extension of Pauli’s phase retrieval problem. Anal. Math., 42(3):185-201, 2016
2016
-
[23]
X. Su, R. Tao, Y. Li. Phase retrieval from multiple FRFT measurements based on nonconvex low-rank minimization. Signal Process., 198:108601, 2022
2022
-
[24]
Y. Yang, R. Tao, K. Wei, et al. Single-shot phase retrieval from a frac- tional Fourier transform perspective. IEEE Trans. Signal Process. , 72:3303- 3317, 2024
2024
-
[25]
B. Robert. Ambiguities in one-dimensional phase retrieval from magnitudes of a linear canonical transform. Z. Angew. Math. Mec. , 97(9):1078–1082, 2017
2017
-
[26]
Y. Chen, N. Qu. Phase retrieval from linear canonical transforms. Numer. Funct. Anal. Optim. , 43(15):1760–1777, 2022
2022
-
[27]
Y. Li, G. Wu, Y. Huang, et al. Phase retrieval from intensity difference of linear canonical transform. Banach J. Math. Anal. , 18(1):3, 2024
2024
-
[28]
P. Jaming. Uniqueness results in an extension of Pauli’s phase retrieval problem. Appl. Comput. Harmon. Anal. , 37(3):413–441, 2014
2014
-
[29]
L. Li, L. Mao, M. Jing, et al. Phase retrieval from short-time fractional Fourier measurements using alternating direction method of multipliers. Int. J. Wavelets Multi. Inform. Process. , 21(5):2350015, 2023
2023
-
[30]
Zhang, Z
Q. Zhang, Z. Guo. Uniqueness of STFT phase retrieval for bandlimited vector functions. Numer. Funct. Anal. Optim. , 44(4):311–331, 2023
2023
-
[31]
R. Li, B. Liu, Q. Zhang. Uniqueness of STFT phase retrieval in shift-invariant spaces. Appl. Math. Lett. , 118:107131, 2021
2021
-
[33]
Q. Zhang. Uniqueness guarantees for phase retrieval from discrete windowed fractional Fourier transform. Optik., 158:1491–1498, 2018
2018
-
[35]
Y. Li, Q. Zhang, R. Li, et al. Uniqueness of short-time linear canonical transform phase retrieval for bandlimited signals. Circu. Syst. Signal Process. , 44(2):1120–1137, 2025
2025
-
[36]
Zhang, Y
Q. Zhang, Y. Su, R. Li. Uniqueness guarantees for phase retrieval from discrete windowed special affine Fourier transform. Optik., 242:167295, 2021
2021
-
[37]
A. Stern. Sampling of compact signals in offset linear canonical transform domains. Signal Image Video Process. , 1(4):359–367, 2007
2007
-
[38]
H. Huo. Uncertainty principles for the offset linear canonical transform. Circu. Syst. Signal Process., 38(1):395–406, 2019
2019
-
[39]
H. Huo, W. Sun, L. Xiao. Uncertainty principles associated with the offset linear canonical transform. Math. Meth. Appl. Sci. , 42(2):466–474, 2019
2019
-
[40]
Pei, J.J
S.C. Pei, J.J. Ding. Eigenfunctions of the offset Fourier, fractional Fourier, and linear canonical transforms. J. Opt. Soc. Amer. A , 20(3):522–532, 2003
2003
-
[41]
N. Andi, B. Mawardi. New fundamental inequalities for fractional ambiguity function. Int. J. Math. Comput. Sci. , 19(2):453–458, 2024
2024
-
[42]
Wiener, R
N. Wiener, R. Paley. Fourier transforms in the complex domain . Amer. Math. Soc., 1934
1934
-
[43]
C.E. Shannon. Communication in the presence of noise. Pro. IRE., 37(1):10–21, 1949
1949
-
[44]
L.D. Branges. Hilbert Spaces of Entire Functions . Prentice-Hall,Inc, 1968
1968
-
[45]
Beinert, G
R. Beinert, G. Plonka. Ambiguities in one-dimensional discrete phase retrieval from Fourier magnitudes. J. Fourier Anal. Appl. , 21(6):1169–1198, 2015
2015
-
[46]
Y. Chen, C. Cheng. Phase retrieval of real-valued signals in a shift-invariant space. Appl. Comput. Harmon. Anal. , 49(1):56–73, 2020. 21
2020
Reviewed August 7, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.