Search arXivSearch

arXiv · 2608.02450

PhaseLift for Coded Diffraction Patterns: Optimal Sampling Rate

Abstract

Recovering a complex-valued signal from coded diffraction patterns, namely the Fourier intensities obtained after modulating the signal with a collection of masks, is a fundamental structured phase retrieval problem arising in diffraction imaging and related applications. Despite its practical importance, the theoretical analysis of this structured framework remains scarce. In the standard random mask model, the optimal sampling rate achievable by computationally tractable recovery methods has remained open. In this paper, we establish the optimal sampling rate for the PhaseLift feasibility program. More precisely, PhaseLift achieves exact recovery of an unknown signal $\pmb{x}_0\in\mathbb{C}^n$, up to a global phase, from $\mathcal{O}(\log n)$ random masks, with polynomially decaying failure probability. Since $Ω(\log n)$ masks are necessary to identify certain signals under the erasure mask ensemble, our result thereby achieves the optimal mask complexity. Equivalently, PhaseLift attains the optimal total sampling rate of $m=\mathcal{O}( n\log n)$ scalar intensity measurements. The proof is based on an approximate dual certificate construction via a refined golfing scheme that combines adaptive mask allocation with a dimension-independent truncation threshold.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gao Huang, Song Li. 2026-08-03. PhaseLift for Coded Diffraction Patterns: Optimal Sampling Rate. https://arxiv.org/abs/2608.02450

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT