On convexity and identifiability in 1-D Fourier phase retrieval
This paper considers phase retrieval from the magnitude of 1-D oversampled Fourier measurements. We first revisit the well-known lack of identifiability in this case, and point out that there always exists a solution that is minimum phase, even though the desired signal is not. Next, we explain how...
Saved in:
Published in | 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) pp. 3941 - 3945 |
---|---|
Main Authors | , , |
Format | Conference Proceeding Journal Article |
Language | English |
Published |
IEEE
01.03.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper considers phase retrieval from the magnitude of 1-D oversampled Fourier measurements. We first revisit the well-known lack of identifiability in this case, and point out that there always exists a solution that is minimum phase, even though the desired signal is not. Next, we explain how the least-squares formulation of this problem can be optimally solved via PhaseLift followed by spectral factorization, and this solution is always minimum phase. A simple approach is then proposed to circumvent non-identifiability: adding an impulse to an arbitrary complex signal (offset to the Fourier transform) before taking the quadratic measurements, so that a minimum phase signal is constructed and thus can be uniquely estimated. Simulations with synthetic data show the effectiveness of the proposed method. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Conference-1 ObjectType-Feature-3 content type line 23 SourceType-Conference Papers & Proceedings-2 |
ISSN: | 2379-190X |
DOI: | 10.1109/ICASSP.2016.7472416 |