An analysis of the local convergence speed of constant gain algorithms for direct form IIR adaptive filters is initially presented, showing the adverse effects that result from the proximity of the poles of the modelled system to the unit circle and, for complex poles, to the real axis. A global analysis of the reduced error surface in these cases is also presented, which shows that, away from the global minimum, there will be regions with an almost constant error, where the convergence of constant gain algorithms tends to be slow. A polyphase IIR adaptive filter is then proposed and its local and global convergence properties are investigated, showing it to be specially well suited for applications with underdamped low-frequency poles. The polyphase structure is tested with different constant gain algorithms in an echo-cancellation example, attaining a gain of 14 to 70 times in global convergence speed over the direct form, at the price of a relatively modest increase in computational complexity. A theorem concerning the existence of stationary points for the polyphase structure is also presented.
[1]
Hong Fan,et al.
A structural view of asymptotic convergence speed of adaptive IIR filtering algorithms. I. Infinite precision implementation
,
1993,
IEEE Trans. Signal Process..
[2]
Walter Y. Chen,et al.
High Bit Rate Digital Subscriber Line Echo Cancellation
,
1991,
IEEE J. Sel. Areas Commun..
[3]
Peter Lancaster,et al.
The theory of matrices
,
1969
.
[4]
J. Christensen.
Doctoral thesis
,
1970
.
[5]
P. Regalia.
Adaptive IIR Filtering in Signal Processing and Control
,
1994
.
[6]
Steve Rogers,et al.
Adaptive Filter Theory
,
1996
.