Convergence analysis of recursive identification algorithms based on the nonlinear Wiener model

Publisher Website
Google Scholar
Abstract
Recursive identification algorithms, based on the nonlinear Wiener model, are presented. A recursive identification algorithm is first derived from a general parameterization of the Wiener model, using a stochastic approximation framework. Local and global convergence of this algorithm can be tied to the stability properties of an associated differential equation. Since inversion is not utilized, noninvertible static nonlinearities can be handled, which allows a treatment of, for example, saturating sensors and blind adaptation problems. Gauss-Newton and stochastic gradient algorithms for the situation where the static nonlinearity is known are then suggested in the single-input/single-output case. The proposed methods can outperform conventional linearizing inversion of the nonlinearity when measurement disturbances affect the output signal. For FIR (finite impulse response) models, it is also proved that global convergence of the schemes is tied to sector conditions on the static nonlinearity. In particular, global convergence of the stochastic gradient method is obtained, provided that the nonlinearity is strictly monotone. The local analysis, performed for IIR (infinite impulse response) models, illustrates the importance of the amplitude contents of the exciting signals.

This publication has 22 references indexed in Scilit: