By Topic

Optimizing multistage decimation and interpolation processing

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
$33 $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)
M. W. Coffey ; Dept. of Phys., Colorado Sch. of Mines, Golden, CO, USA

The optimization problem for the design of multistage decimators and interpolators is considered. The corresponding objective function for sample rate increase or decrease is based upon the number of multiplies and adds per second. The structure of the multidimensional gradient equations for the decimation or interpolation ratios is investigated. A drastic simplification of the minimization process is demonstrated. Even for an arbitrary number of stages K, the solution of the K-1-dimensional problem can be reduced to one dimension, giving an enormous saving in computation. The highly applicable cases of K=3 and K=4 are treated explicitly.

Published in:

IEEE Signal Processing Letters  (Volume:10 ,  Issue: 4 )