Reconstruction from unevenly spaced sampled data using the iterative methods

Two iterative algorithms were introduced for reconstructing a band-limited function from its unevenly spaced sampled data. Each iterative method introduces its own varying coefficient which is adaptively determined at each iteration. A varying coefficient for the first algorithm is adaptively determined based on minimizing the error energy of the signal at each iteration. The second method (the method of steepest descent) determines a varying coefficient based on minimizing the error energy reduction of the unevenly spaced sampled data at each iteration. We show that the reconstructed signal from these algorithms converges to the desired signal when the sampling set {t/sub n/} is a sequence such that the nonharmonic Fourier functions {exp(jwt/sub n/)} form a complete set in the signal subspace of the original signal. >