Positive trigonometric polynomials and one-dimensional discrete phase retrieval problem
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
Details
| Original language | English |
|---|---|
| Title of host publication | 2016 24th European Signal Processing Conference (EUSIPCO) |
| Publisher | IEEE |
| Pages | 433-437 |
| Number of pages | 5 |
| ISBN (Electronic) | 978-0-9928-6265-7 |
| DOIs | |
| Publication status | Published - 29 Aug 2016 |
| Publication type | A4 Article in a conference publication |
| Event | European Signal Processing Conference - Duration: 1 Jan 1900 → … |
Publication series
| Name | |
|---|---|
| ISSN (Electronic) | 2076-1465 |
Conference
| Conference | European Signal Processing Conference |
|---|---|
| Period | 1/01/00 → … |
Abstract
In this paper some results on Schur transform are reviewed to address the problem of one-dimensional discrete phase retrieval. The goal is to provide a test whether a sequence of input magnitude data gives a solution to one-dimensional discrete phase retrieval problem. It has been previously shown that this issue is related to the nonnegativity of trigonometric polynomials. The proposed method is similar to the table procedure for counting the multiplicities of zeros on unit circle. Examples and numerical results are also provided to indicate that the problem of one-dimensional discrete phase retrieval often does not have a solution.
Keywords
- Correlation, Discrete Fourier transforms, Europe, Signal processing, Signal processing algorithms