Answers are grounded in this paper and cite their sources.
Theoretical analysis demonstrates convergence of iterative nonexpansive signal reconstruction algorithms, indicating robust recovery under nonlinear constraints and non-unique conditions.
Iterative algorithms for signal reconstruction from partial time- and frequency-domain knowledge have proven useful in a number of application areas. In this paper, a general convergence proof, applicable to a general class of such iterative reconstruction algorithms, is presented. The proof relies on the concept of a nonexpansive mapping in both the time and frequency domains. Two examples studied in detail are time-limited extrapolation (equivalently, band-limited extrapolation) and phase-only signal reconstruction. The proof of convergence for the phase-only iteration is a new result obtained by this method of proof. The generality of the approach allows the incorporation of nonlinear constraints such as time- (or space-) domain positivity or minimum and maximum value constraints. Finally, the underrelaxed form of these iterations is also shown to converge even when the solution is not guaranteed to be unique.
No takes yet. Share an insight, caveat, or question.
Tom et al. (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: