Abstract
We consider the classical 1D phase retrieval problem. In order to overcome the difficulties associated with phase retrieval from measurements of the Fourier magnitude, we treat recovery from the magnitude of the short-time Fourier transform (STFT). We first show that the redundancy offered by the STFT enables unique recovery for arbitrary nonvanishing inputs, under mild conditions. An efficient algorithm for recovery of a sparse input from the STFT magnitude is then suggested, based on an adaptation of the recently proposed GESPAR algorithm. We demonstrate through simulations that using the STFT leads to improved performance over recovery from the oversampled Fourier magnitude with the same number of measurements.
| Original language | English |
|---|---|
| Article number | 6932437 |
| Pages (from-to) | 638-642 |
| Number of pages | 5 |
| Journal | IEEE Signal Processing Letters |
| Volume | 22 |
| Issue number | 5 |
| Early online date | 21 Oct 2014 |
| DOIs | |
| State | Published - 1 May 2015 |
Keywords
- GESPAR
- phase retrieval
- short-time Fourier transform
- sparsity
All Science Journal Classification (ASJC) codes
- Signal Processing
- Electrical and Electronic Engineering
- Applied Mathematics