Abstract
In this paper, we introduce two undirected graphs depending on supports of signals and windows, and we show that the connectivity of those graphs provides either necessary or sufficient conditions to phase retrieval of a signal from magnitude measurements of its multiple-window short-time Fourier transform. Also, we propose an algebraic reconstruction algorithm, and provide an error estimate to our algorithm when magnitude measurements are corrupted by deterministic/random noises. © 2017 IEEE.
| Original language | English |
|---|---|
| Article number | 7839910 |
| Pages (from-to) | 372-376 |
| Journal | IEEE Signal Processing Letters |
| Volume | 24 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Apr 2017 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Phase retrieval
- short-time Fourier transform (STFT)
Fingerprint
Dive into the research topics of 'Phase Retrieval from Multiple-Window Short-Time Fourier Measurements'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver