Sampling and reconstruction of signals in a reproducing kernel subspace of \(L^p(\mathbb R^d)\) (Q2269687): Difference between revisions

For signals in a reproducing kernel subspace of \(L^p(\mathbb{R}^d), 1\leq p\leq \infty\) which is associated with an idempotent integral operator whose kernel has certain off-diagonal decay and regularity, this paper establishes sampling theorem in Theorem 2.1 saying that such signals can be always reconstructed in a stable way from its samples taken on a relatively-separated sampling set with sufficiently small sampling gap. Then two algorithms are presented to reconstruct such signals: the iterative approximation-projection reconstruction algorithm in Section 3, and iterative frame reconstruction algorithm in Section 4. Asymptotic pointwise error estimates for the reconstruction algorithms are obtained in Section 5. This framework includes several classical settings of sampling and reconstruction as special cases.