Adaptive lattice IIR filtering revisited:: Convergence issues and new algorithms with improved stability properties

Several algorithms for adaptive IIR filters parameterized in lattice form can be found in the literature. The salient feature of these structures when compared,vith the direct form is that ensuring stability is extremely easy. On the other hand, while computing the gradient signals that drive the direct form update algorithms is straightforward, it is not so for the lattice algorithms, This has led to simplified lattice algorithms using gradient approximations. Although, in general, these;simplified schemes present the same stationary points as the original algorithms, whether this is also true for convergent points has remained an open problem. This also applies to nongradient-based lattice algorithms such as hyperstability based and the Steiglitz-McBride algorithms, Here, we ans,ver this question in the negative, by showing that for several adaptive lattice algorithms, there exist settings in which the stationary point corresponding to identification of the unknown system is not convergent, In addition, new lattice algorithms with improved convergence properties are derived. They are based in the cascade lattice structure, which allows the derivation of sufficient conditions for local stability.