Signal denoising with average sampling
Digital Signal Processing
| Hi-index | 754.84 |
We consider the problem of recovering a band-limited signal f(t) from noisy data yk=f(kτ)+≫epsilon/k, where τ is the sampling rate. Starting from the truncated Whittaker-Shannon cardinal expansion with or without sampling windows (both cases yield inconsistent estimates of f(t)) we propose estimators that are convergent to f(t) in the pointwise and uniform sense. The basic idea is to cut down high frequencies in the data and to use suitable oversampling τ⩽π/Ω, Ω being the bandwidth (maximum frequency) of f(t). The simplest estimator we propose is given by fˆn(t)=τ Σ/|t-kτ|⩽nτ yksin(Ω(t-kτ))/π(t-kτ),|t|⩽nτ. Generalizations of fˆn including sampling windows are also examined. The main aim is to examine the mean squared error (MSE) properties of such estimators in order to determine the optimal choice of the sampling rate τ yielding the fastest possible rate of convergence. The best rate for the MSE we obtain is O(In(n)/n)