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.

我们研究了无相短时傅里叶变换 (STFT) 测量下的相位检索 (PR) 问题。本文提出了一种名为PAR的新算法，分别在相位和幅度上解决STFT PR问题，与原始方法相比具有更温和的检索条件。首先，提出了一种对称的无向信号图来计算相对相位。然后讨论了单窗口情况下STFT PR问题的检索条件，并提出了一些较LS方法较弱的检索条件。我们还讨论了多窗口中的 STFT PR 问题，并建立了不受滑动步长L限制的检索定理。我们给出了PAR算法的一些数值结果。