Conference paper

Exact Local Reconstruction Algorithms for Signals with Finite Rate of Innovation

Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomial or piecewise sinusoidal signals, and call the number of degrees of freedom per unit of time the rate of innovation. Classical sampling theory does not enable a perfect reconstruction of such signals since they are not bandlimited. In this paper, we show that many signals with finite rate of innovation can be sampled and perfectly reconstructed using kernels of compact support and a local reconstruction algorithm. The class of kernels that we can use is very rich and includes functions satisfying strang-fix conditions, exponential splines and functions with rational Fourier transforms. Extension of such results to the 2-dimensional case are also discussed and an application to image super-resolution is presented

Related material