pith. sign in

arxiv: 1611.01850 · v4 · pith:6SYX4OEBnew · submitted 2016-11-06 · 💻 cs.IT · math.IT

On High-Resolution Adaptive Sampling of Deterministic Signals

classification 💻 cs.IT math.IT
keywords samplinghigh-resolutionquantizationsignalhigh-rateoptimaladaptivedeterministic
0
0 comments X
read the original abstract

In this work we study the topic of high-resolution adaptive sampling of a given deterministic signal and establish a connection with classic approaches to high-rate quantization. Specifically, we formulate solutions for the task of optimal high-resolution sampling, counterparts of well-known results for high-rate quantization. Our results reveal that the optimal high-resolution sampling structure is determined by the density of the signal-gradient energy, just as the probability-density-function defines the optimal high-rate quantization form. This paper has three main contributions: the first is establishing a fundamental paradigm bridging the topics of sampling and quantization. The second is a theoretical analysis of nonuniform sampling relevant to the emerging field of high-resolution signal processing. The third is a new practical approach to nonuniform sampling of one-dimensional signals that enables reconstruction based only on the sampling time-points and the signal extrema locations and values. Experiments for signal sampling and coding showed that our method outperforms an optimized tree-structured sampling technique.

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.