Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

A structural view of asymptotic convergence speed of adaptive IIR filtering algorithm. II. Finite precision implementation

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)
Fan, H. ; Dept. of Electr. & Comput. Eng., Cincinnati Univ., OH, USA

For pt.I see ibid., vol.41, no.4, p.1493-1517, 1993. Finite precision (FP) implementation is the ultimately inevitable reality of all adaptive filters, including adaptive infinite impulse response (IIR) filters. This paper continues to examine the asymptotic convergence speed of adaptive IIR filters of various structures and algorithms, including the simple constant gain type and the Newton type, but under FP implementation. A stochastic differential equation (SDE) approach is used in the analysis. Such an approach not only greatly simplifies the FP analysis, which is traditionally very involved algebraically, but it also provides valuable information about the first-order as well as the second-order moments that (the latter) are not available using the ordinary differential equation (ODE) approach. The asymptotic convergence speed, as well as the convergent values, of the pertinent moments of FP errors are examined in terms of unknown system pole-zero locations. The adverse effects of lightly damped low-frequency (LDLF) poles resulting from fast sampling on the local transient and convergent behavior of various structures and algorithms are analyzed and compared. The new results agree with the existing ones when reduced to the finite impulse response (FIR) case. In particular, the explosive behavior of pertinent error variances of Newton-type IIR algorithms when the forgetting factor λ=1 is also concluded. Computer simulation verifies the predicted theoretical results

Published in:

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