Time-Stampless Adaptive Nonuniform Sampling for Stochastic Signals

Details Time-Stampless Adaptive Nonuniform Sampling for Stochastic Signals Time-Stampless Adaptive Nonuniform Sampling for Stochastic Signals

2011-10-17

arxiv.org/abs/1110.3774v1

Computer Science

Information Theory

Submitted to IEEE Transactions on Signal Processing (partially presented at Allerton 2010)

Scientific paper

In this paper, we introduce a time-stampless adaptive nonuniform sampling (TANS) framework, in which time increments between samples are determined by a function of the $m$ most recent increments and sample values. Since only past samples are used in computing time increments, it is not necessary to save sampling times (time stamps) for use in the reconstruction process. We focus on two TANS schemes for discrete-time stochastic signals: a greedy method, and a method based on dynamic programming. We analyze the performances of these schemes by computing (or bounding) their trade-offs between sampling rate and expected reconstruction distortion for autoregressive and Markovian signals. Simulation results support the analysis of the sampling schemes. We show that, by opportunistically adapting to local signal characteristics, TANS may lead to improved power efficiency in some applications.

Affiliated with

Also associated with

No associations

Rating

Time-Stampless Adaptive Nonuniform Sampling for Stochastic Signals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Time-Stampless Adaptive Nonuniform Sampling for Stochastic Signals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time-Stampless Adaptive Nonuniform Sampling for Stochastic Signals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319294