Adaptive sampling of time-space signals in a reproducing kernel subspace of mixed Lebesgue space

From MaRDI portal
Publication:778753

DOI10.1007/S43037-019-00040-2zbMATH Open1457.46033arXiv1904.00727OpenAlexW2998455339MaRDI QIDQ778753FDOQ778753


Authors: Ying-chun Jiang, Wenchang Sun Edit this on Wikidata


Publication date: 20 July 2020

Published in: Banach Journal of Mathematical Analysis (Search for Journal in Brave)

Abstract: The Mixed Lebesgue space is a suitable tool for modelling and measuring signals living in time-space domains. And sampling in such spaces plays an important role for processing high-dimensional time-varying signals. In this paper, we first define reproducing kernel subspaces of mixed Lebesgue spaces. Then, we study the frame properties and show that the reproducing kernel subspace has finite rate of innovation. Finally, we propose a semi-adaptive sampling scheme for time-space signals in a reproducing kernel subspace, where the sampling in time domain is conducted by a time encoding machine. Two kinds of timing sampling methods are considered and the corresponding iterative approximation algorithms with exponential convergence are given.


Full work available at URL: https://arxiv.org/abs/1904.00727




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Adaptive sampling of time-space signals in a reproducing kernel subspace of mixed Lebesgue space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778753)