Identification of extended hammerstein systems using dynamic self-optimizing neural networks

Xuemei Ren*, Xiaohua Lv

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

34 Citations (Scopus)

Abstract

In this paper, a new dynamic self-optimizing neural network (DSONN) with online adjusting hidden layer and weights is proposed for a class of extended Hammerstein systems with non-Gaussian noises. Input vector to the network is first determined by means of system order estimation using a designated input signal. Then the hidden layer is generated online, which consists of a growing step according to the plant dynamics and a revised pruning step used to refine the hidden structure such that the generated model can be a minimal realization with satisfactory performance. The algorithm is capable of adjusting both the network structure and weights simultaneously by using of weight variations as the conditions of structure optimization. An integrated performance including the identification error and an additional entropy penalty term is employed such that the model can attenuate the non-Gaussian noises as well as match the unknown plant automatically with a suitable structure. Convergence of the weights is guaranteed by suitably choosing the learning rates. The proposed DSONN can be established without a priori knowledge of the unknown nonlinearity. The efficiency of the method is illustrated through the applications to three different Hammerstein systems.

Original languageEnglish
Article number5928420
Pages (from-to)1169-1179
Number of pages11
JournalIEEE Transactions on Neural Networks
Volume22
Issue number8
DOIs
Publication statusPublished - Aug 2011

Keywords

  • Dynamic self-optimizing neural network
  • extended Hammerstein systems
  • integrated performance
  • system identification

Fingerprint

Dive into the research topics of 'Identification of extended hammerstein systems using dynamic self-optimizing neural networks'. Together they form a unique fingerprint.

Cite this