By Topic

An adaptive IIR filter algorithm based on observers

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

2 Author(s)
Hacioglu, R. ; Dept. of Electr. & Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA ; Williamson, G.A.

The output error approach to adaptive IIR filtering is considered from a state observation perspective, and a new algorithm, termed the observer-based regressor filtering (OBRF) algorithm, is developed. The convergence requirements of the OBRF are established as a persistent excitation condition on the regressor and a strict positive reality (SPR) condition on an operator arising in the algorithm. Speed of convergence experiments show that the OBRF algorithm converges more quickly than the related output error algorithm for the hyperstable adaptive recursive filter (HARF), although the OBRF algorithm converges as quickly as typical equation error schemes. The OBRF is shown to compare favorably with equation error with respect to parameter bias in the presence of output measurement noise. Thus, OBRF is a compromise between the equation error and output error approaches. In addition, algorithm parameter selection to satisfy the SPR condition for OBRF is explored and compared with the related conditions for HARF

Published in:

Signal Processing, IEEE Transactions on  (Volume:48 ,  Issue: 5 )