Sampling based on timing: Time encoding machines on shift-invariant subspaces

Details Sampling based on timing: Time encoding machines on shift-invariant subspaces Sampling based on timing: Time encoding machines on shift-invariant subspaces

2011-08-16

arxiv.org/abs/1108.3149v1

Computer Science

Information Theory

submitted to Applied and Computationnal Harmonic Analysis

Scientific paper

Sampling information using timing is a new approach in sampling theory. The question is how to map amplitude information into the timing domain. One such encoder, called time encoding machine, was introduced by Lazar and Toth in [18] for the special case of band-limited functions. In this paper, we extend their result to the general framework of shift-invariant subspaces. We prove that time encoding machines may be considered as non-uniform sampling devices, where time locations are unknown a priori. Using this fact, we show that perfect representation and reconstruction of a signal with a time encoding machine is possible whenever this device satisfies some density property. We prove that this method is robust under timing quantization, and therefore can lead to the design of simple and energy efficient sampling devices.

Affiliated with

Also associated with

No associations

Rating

Sampling based on timing: Time encoding machines on shift-invariant subspaces 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 Sampling based on timing: Time encoding machines on shift-invariant subspaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sampling based on timing: Time encoding machines on shift-invariant subspaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-194805