Identification of Wiener–Hammerstein models: Two algorithms based on the best split of a linear model applied to the SYSID'09 benchmark problem

Journal article, 2012

This paper describes the identification of Wiener–Hammerstein models and two recently suggested algorithms are applied to the SYSID'09 benchmark data. The most difficult step in the identification process of such block-oriented models is to generate good initial values for the linear dynamic blocks so that local minima are avoided. Both of the considered algorithms obtain good initial estimates by using the best linear approximation (BLA) which can easily be estimated from data. Given the BLA, the two algorithms differ in the way the dynamics are separated into two linear parts. The first algorithm simply considers all possible splits of the dynamics. Each of the splits is used to initialize one Wiener–Hammerstein model using linear least-squares and the best performing model is selected. In the second algorithm, both linear blocks are initialized with the entire BLA model using basis function expansions of the poles and zeros of the BLA. This gives over-parameterized linear blocks and their order is decreased in a model reduction step. Both algorithms are explained and their properties are discussed. They both give good, comparable models on the benchmark data.