作者: B.E. Dunne , G.A. Williamson
关键词:
摘要: Steepest descent gradient algorithms for unbiased equation error adaptive infinite impulse response (IIR) filtering are analyzed collectively both the total least squares and mixed squares-total framework. These have a monic normalization that allows direct implementation. We show converge to desired filter coefficient vector. achieve convergence result by analyzing stability of equilibrium points demonstrate only solution is locally stable. Additionally, we describe region initialization under which algorithm converges solution. derive results using interlacing relationships between eigenvalues data correlation matrices their respective Schur complements. Finally, illustrate performance these new approaches through simulation.