Convergence analysis of error-reduction algorithm for solving of the extended one-dimensional discrete phase retrieval problem

Corneliu Rusu; Jaakko Astola

doi:10.1109/ISSCS.2017.8034945

Convergence analysis of error-reduction algorithm for solving of the extended one-dimensional discrete phase retrieval problem

Corneliu Rusu, Jaakko Astola

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

3 Citations (Scopus)

Abstract

The iterative methods are well-known approaches to solve the one-dimensional phase retrieval problem. Amongst them, the error-reduction algorithm is often used since it can easily implement support constraints. Unfortunately this method often stagnates. Recently we have formulated the extended form of the one-dimensional discrete phase retrieval problem and we have assumed that the stagnation can be avoided by oversampling. Simulations have indicated that the conjecture is true. In this work we prove the convergence of the error-reduction algorithm in the proposed extended one-dimensional discrete phase retrieval framework.

Original language	English
Title of host publication	ISSCS 2017 - International Symposium on Signals, Circuits and Systems
Publisher	IEEE
ISBN (Electronic)	9781538606742
DOIs	https://doi.org/10.1109/ISSCS.2017.8034945
Publication status	Published - 12 Sept 2017
Publication type	A4 Article in conference proceedings
Event	INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS & SYSTEMS - Duration: 1 Jan 1900 → …

Conference

Conference	INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS & SYSTEMS
Period	1/01/00 → …

Publication forum classification

Publication forum level 1

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering
Signal Processing

Access to Document

10.1109/ISSCS.2017.8034945

Cite this

@inproceedings{8d3b3820ba544f199114c06b944f7199,

title = "Convergence analysis of error-reduction algorithm for solving of the extended one-dimensional discrete phase retrieval problem",

abstract = "The iterative methods are well-known approaches to solve the one-dimensional phase retrieval problem. Amongst them, the error-reduction algorithm is often used since it can easily implement support constraints. Unfortunately this method often stagnates. Recently we have formulated the extended form of the one-dimensional discrete phase retrieval problem and we have assumed that the stagnation can be avoided by oversampling. Simulations have indicated that the conjecture is true. In this work we prove the convergence of the error-reduction algorithm in the proposed extended one-dimensional discrete phase retrieval framework.",

author = "Corneliu Rusu and Jaakko Astola",

note = "EXT={"}Rusu, Corneliu{"}; INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS & SYSTEMS ; Conference date: 01-01-1900",

year = "2017",

month = sep,

day = "12",

doi = "10.1109/ISSCS.2017.8034945",

language = "English",

booktitle = "ISSCS 2017 - International Symposium on Signals, Circuits and Systems",

publisher = "IEEE",

address = "United States",

}

TY - GEN

T1 - Convergence analysis of error-reduction algorithm for solving of the extended one-dimensional discrete phase retrieval problem

AU - Rusu, Corneliu

AU - Astola, Jaakko

N1 - EXT="Rusu, Corneliu"

PY - 2017/9/12

Y1 - 2017/9/12

N2 - The iterative methods are well-known approaches to solve the one-dimensional phase retrieval problem. Amongst them, the error-reduction algorithm is often used since it can easily implement support constraints. Unfortunately this method often stagnates. Recently we have formulated the extended form of the one-dimensional discrete phase retrieval problem and we have assumed that the stagnation can be avoided by oversampling. Simulations have indicated that the conjecture is true. In this work we prove the convergence of the error-reduction algorithm in the proposed extended one-dimensional discrete phase retrieval framework.

AB - The iterative methods are well-known approaches to solve the one-dimensional phase retrieval problem. Amongst them, the error-reduction algorithm is often used since it can easily implement support constraints. Unfortunately this method often stagnates. Recently we have formulated the extended form of the one-dimensional discrete phase retrieval problem and we have assumed that the stagnation can be avoided by oversampling. Simulations have indicated that the conjecture is true. In this work we prove the convergence of the error-reduction algorithm in the proposed extended one-dimensional discrete phase retrieval framework.

U2 - 10.1109/ISSCS.2017.8034945

DO - 10.1109/ISSCS.2017.8034945

M3 - Conference contribution

AN - SCOPUS:85032302395

BT - ISSCS 2017 - International Symposium on Signals, Circuits and Systems

PB - IEEE

T2 - INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS & SYSTEMS

Y2 - 1 January 1900

ER -

Convergence analysis of error-reduction algorithm for solving of the extended one-dimensional discrete phase retrieval problem

Abstract

Conference

Publication forum classification

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this