On orthogonal realizations for adaptive IIR filters

Abstract

Convergence speed is one of the main concerns in adaptive IIR filters. Fast convergence can be closely related to adaptive filter realization. However, with the exception of the lattice realization that is based on the nice properties of Szëgo orthonormal polynomials, no other adaptive IIR filter realization using orthonormal characteristics seems to be extensively studied in the literature. Furthermore, many orthogonal realizations for adaptive FIR filters, that are particularly suitable for rational modelling, have been proposed in the past years. Since rational orthogonal basis functions are a powerful tool for efficient system representation they seem attractive for adaptive IIR filters. In this paper, we present some theoretical results related to the properties of a generalized orthonormal realization when used for mean‐square output error minimization in a system identification application. One result is related to the low computational complexity of the updating gradient algorithm when some properties of the orthonormal realization are used. An additional result establishes conditions for the stationary points of the proposed updating algorithm. In order to confirm the expected performance of the new realization, some simulations and comparisons with competing realizations in terms of computational complexity and convergence speed are presented.