Wiener-Hammerstein Model Identification-Recursive Algorithms.

Recursive parameter identification of Hammerstein-Wiener systems with measurement noise

A recursive algorithm is proposed in this paper to identify Hammerstein–Wiener systems with heteroscedastic measurement noise. Based on the parameterization model of Hammerstein–Wiener systems, the algorithm is derived by minimizing the expectation of the sum of squared parameter estimation errors. By replacing the immeasurable internal variables with their estimations, the need for the commonl...

Identification of Hammerstein-Wiener models

This paper develops and illustrates a new maximum-likelihood based method for the identification of Hammerstein–Wiener model structures. A central aspect is that a very general situation is considered wherein multivariable data, non-invertible Hammerstein and Wiener nonlinearities, and coloured stochastic disturbances both before and after the Wiener nonlinearity are all catered for. The method...

Nonlinear System Identification Using Hammerstein-Wiener Neural Network and subspace algorithms

Neural networks are applicable in identification systems from input-output data. In this report, we analyze theHammerstein-Wiener models and identify them. TheHammerstein-Wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two static nonlinear blocks, whichappear in many engineering applications; the aim of nonlinearsyst...

Extended stochastic gradient identification algorithms for Hammerstein-Wiener ARMAX systems

An extended stochastic gradient algorithm is developed to estimate the parameters of Hammerstein–Wiener ARMAX models. The basic idea is to replace the unmeasurable noise terms in the information vector of the pseudo-linear regression identification model with the corresponding noise estimates which are computed by the obtained parameter estimates. The obtained parameter estimates of the identif...

Identification of Wiener–Hammerstein benchmark model via rank minimization