Abstract
We study the Phase Retrieval (PR) problem under the phaseless short-time Fourier transform (STFT) measurements. This paper proposes a novel algorithm named PAR to solve the STFT PR problem in phase and amplitude respectively with a milder retrieval condition compared with the original methods. First, a symmetric undirected graph of signals is proposed for the computation of the relative phase. Then the retrieval conditions of STFT PR problem are discussed for a single window case and some weaker retrieval conditions are proposed compared with the LS method. We also discuss STFT PR problem in multiple windows and establish retrieval theorems without restrictions of sliding step-size L. We give some numerical results of the PAR algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
