pith. sign in

arxiv: 0909.2292 · v3 · pith:4XJ7COOVnew · submitted 2009-09-14 · 💻 cs.IT · cs.CE· math.IT· math.NA

Random Sampling Using Shannon Interpolation and Poisson Summation Formulae

classification 💻 cs.IT cs.CEmath.ITmath.NA
keywords randomsamplingformulaeinterpolationmethodspoissonrecoveryshannon
0
0 comments X
read the original abstract

This report mainly focused on the basic concepts and the recovery methods for the random sampling. The recovery methods involve the orthogonal matching pursuit algorithm and the gradient-based total variation strategy. In particular, a fast and efficient observation matrix filling technique was implemented by the classic Shannon interpolation and Poisson summation formulae. The numerical results for the trigonometric signal, the Gaussian-modulated sinusoidal pulse, and the square wave were demonstrated and discussed. The work may give some help for future work in theoretical study and practical implementation of the random sampling.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.