IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v48y2017i11p2405-2414.html
   My bibliography  Save this article

Decomposition-based recursive least-squares parameter estimation algorithm for Wiener-Hammerstein systems with dead-zone nonlinearity

Author

Listed:
  • Linwei Li
  • Xuemei Ren

Abstract

In this paper, a decomposition-based recursive least-squares algorithm is proposed for the parameter estimation of Wiener-Hammerstein systems with dead-zone. Based on a smooth parameterisation of the dead-zone nonlinearity, the Wiener-Hammerstein systems with dead-zone can be transformed into a particular model where the parameter vector involves the least number of parameters needed for the identification model description by using the key-term separation principle. On the basis of the particular model, the hierarchical identification principle is presented to decompose the particular model into two identification subsystems, whose parameters are estimated by using a recursive least squares and the auxiliary model method. Furthermore, the convergence analysis of the proposed algorithm ensures that the estimated parameters convergence to their true values. Compared with recursive least squares algorithm and multi-innovation least-squares, the proposed algorithm can avoid the redundant parameters estimation, and meanwhile reduce the computational burden. Numerical examples and experiment are carried out to illustrate the validity of the proposed algorithm.

Suggested Citation

  • Linwei Li & Xuemei Ren, 2017. "Decomposition-based recursive least-squares parameter estimation algorithm for Wiener-Hammerstein systems with dead-zone nonlinearity," International Journal of Systems Science, Taylor & Francis Journals, vol. 48(11), pages 2405-2414, August.
  • Handle: RePEc:taf:tsysxx:v:48:y:2017:i:11:p:2405-2414
    DOI: 10.1080/00207721.2017.1320455
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2017.1320455
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2017.1320455?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:48:y:2017:i:11:p:2405-2414. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.