By Topic

Efficient Reconstruction Algorithms Using Shifted Lattices

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)
Behmard, H. ; Math. Dept., Western Oregon Univ., Monmouth, OR

In this paper, we consider sampling theory for irregular sampling sets of minimal density which are structured. An efficient method for the reconstruction of band-limited discrete signals from sampling sets which are unions of shifted lattices is developed. These sets are not necessarily periodic. A signal can be reconstructed from its samples provided the sampling set and the spectrum of the signal satisfy certain compatibility conditions. While explicit reconstruction formulas for unions of sampling lattices are possible, it is more convenient to use a recursive algorithm. A numerical example utilizing nonperiodic sampling sets implemented in MATLAB is given. The theory and the related algorithm has been applied to speech and image processing examples.

Published in:

Signal Processing, IEEE Transactions on  (Volume:57 ,  Issue: 7 )