By Topic

Exact interpolation and iterative subdivision schemes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Herley, C. ; Dept. of Electr. Eng., Columbia Univ., New York, NY, USA

We examine the circumstances under which a discrete-time signal can be exactly interpolated given only every Mth sample. After pointing out the connection between designing an M-fold interpolator and the construction of an M-channel perfect reconstruction filter bank, we derive necessary and sufficient conditions on the signal under which exact interpolation is possible. Bandlimited signals are one obvious example, but numerous others exist. We examine these and show how the interpolators may be constructed. A main application is to iterative interpolation schemes, used for the efficient generation of smooth curves. We show that conventional bandlimited interpolators are not suitable in this context. A better criterion is to use interpolators that are exact for polynomial functions. We demonstrate that these interpolators converge when iterated, and show how these may be designed for any polynomial degree N and any interpolation factor M. This makes it possible to design interpolators for iterative schemes to make best use of the resolution available in a given display medium

Published in:

Signal Processing, IEEE Transactions on  (Volume:43 ,  Issue: 6 )