ON THE CONVERGENCE OF WAVELET-BASED ITERATIVE SIGNAL EXTRAPOLATION ALGORITHMS

A generalized Papoulis-Gerchberg (PG) algorithm for signal extrapolati on based on the wavelet representation has been recently proposed by X ia, Kuo and Zhang. In this research, we examine the convergence proper ty and the convergence rate of several signal extrapolation algorithms in wavelet subspaces. We first show that the generalized PG algorithm converges to the minimum norm solution when the wavelet bases are sem i-orthogonal (or known as the prewavelet). However, the generalized PG algorithm converges slowly in numerical implementation. To accelerate the convergence rate, we formulate the discrete signal extrapolation problem as a two-step process and apply the steepest descent and conju gate gradient methods for its solution. Numerical experiments are give n to illustrate the performance of the proposed algorithms.