On the existence of compactly supported reconstruction functions in a sampling problem

Details On the existence of compactly supported reconstruction functions in a sampling problem On the existence of compactly supported reconstruction functions in a sampling problem

2008-06-12

arxiv.org/abs/0806.2084v1

Computer Science

Information Theory

24 pages

Scientific paper

Assume that samples of a filtered version of a function in a shift-invariant space are avalaible. This work deals with the existence of a sampling formula involving these samples and having reconstruction functions with compact support. Thus, low computational complexity is involved and truncation errors are avoided. This is done in the light of the generalized sampling theory by using the oversampling technique: more samples than strictly necessary are used. For a suitable choice of the sampling period, a necessary and sufficient condition is given in terms of the Kronecker canonical form of a matrix pencil. Comparing with other characterizations in the mathematical literature, the given here has an important advantage: it can be reliable computed by using the GUPTRI form of the matrix pencil. Finally, a practical method for computing the compactly supported reconstruction functions is given for the important case where the oversampling rate is minimum.

Affiliated with

Also associated with

No associations

Rating

On the existence of compactly supported reconstruction functions in a sampling problem 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 On the existence of compactly supported reconstruction functions in a sampling problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the existence of compactly supported reconstruction functions in a sampling problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-690936