By Topic

Optimal estimation of the parameters of all-pole transfer functions

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)
A. K. Shaw ; Dept. of Electr. Eng., Wright State Univ., Dayton, OH, USA

An algorithm is proposed for optimal estimation of the parameters of auto-regressive (AR) or all-pole transfer function models from prescribed impulse response data. The transfer function coefficients are estimated by minimizing the l2-norm of the exact model fitting error. Existing methods either minimize equation errors or modify the true nonlinear error criterion. In the proposed method, the multidimensional nonlinear error criterion has been decoupled into a purely linear and a nonlinear subproblem. Global optimality properties of the decoupled estimators have been established. For data corrupted with Gaussian distributed noise, the proposed method produces maximum-likelihood estimates (MLE) of the AR-parameters. The inherent mathematical structure in the nonlinear subproblem is exploited in formulating an efficient iterative computational algorithm for its minimization. The proposed algorithm provides a useful computational tool based on an appropriate theoretical foundation for accurate modeling of all-pole systems from prescribed impulse response data. The effectiveness of the algorithm has been demonstrated with several simulation examples

Published in:

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing  (Volume:41 ,  Issue: 2 )