Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms

Kejun Huang, Yonina C. Eldar, Nicholas D. Sidiropoulos

Research output: Contribution to journalArticlepeer-review

61 Scopus citations


This paper considers phase retrieval from the magnitude of one-dimensional over-sampled Fourier measurements, a classical problem that has challenged researchers in various fields of science and engineering. We show that an optimal vector in a least-squares sense can be found by solving a convex problem, thus establishing a hidden convexity in Fourier phase retrieval. We then show that the standard semidefinite relaxation approach yields the optimal cost function value (albeit not necessarily an optimal solution). A method is then derived to retrieve an optimal minimum phase solution in polynomial time. Using these results, a new measuring technique is proposed which guarantees uniqueness of the solution, along with an efficient algorithm that can solve large-scale Fourier phase retrieval problems with uniqueness and optimality guarantees.

Original languageEnglish (US)
Article number7547374
Pages (from-to)6105-6117
Number of pages13
JournalIEEE Transactions on Signal Processing
Issue number23
StatePublished - Dec 1 2016

Bibliographical note

Publisher Copyright:
© 2016 IEEE.


  • Phase retrieval
  • alternating direction method of multipliers
  • auto-correlation retrieval
  • holography
  • minimum phase
  • over-sampled Fourier measurements
  • semi-definite programming


Dive into the research topics of 'Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms'. Together they form a unique fingerprint.

Cite this