mlsanityData to 14 Oct 2026

One-Bit Phase Retrieval: More Samples Means Less Complexity?

arXiv 2203.08982 ↗First posted 16 Mar 2022eess.SPcited by 6

Not on the map. Why?

Abstract (arXiv)

The classical problem of phase retrieval has found a wide array of applications in optics, imaging and signal processing. In this paper, we consider the phase retrieval problem in a one-bit setting, where the signals are sampled using one-bit analog-to-digital converters (ADCs). A significant advantage of deploying one-bit ADCs in signal processing systems is their superior sampling rates as compared to their high-resolution counterparts. This leads to an enormous amount of one-bit samples gathered at the output of the ADC in a short period of time. We demonstrate that this advantage pays extraordinary dividends when it comes to convex phase retrieval formulations, namely that the often encountered matrix semi-definiteness constraints as well as rank constraints (that are computationally prohibitive to enforce), become redundant for phase retrieval in the face of a growing sample size. Several numerical results are presented to illustrate the effectiveness of the proposed methodologies.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Mar 2022.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 3; 2024: 0; 2025: 0; 2026: 1.

6 papers.