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

A recursive algorithm for estimating multiple models continuous transfer function with non-uniform sampling

Author

Listed:
  • Anísio Rogério Braga
  • Walmir Caminhas
  • Carmela Maria Polito Braga

Abstract

A multiple model recursive least squares algorithm combined with a first-order low-pass filter transformation method, named λ-transform, is proposed for the simultaneous identification of multiple model orders continuous transfer functions from non-uniformly sampled input–output data. The λ-transformation is shown to be equivalent to a canonical transformation between discrete z-domain and δ-domain using the negative value of the λ-transform filter time-constant instead of the sampling interval parameter. The proposed algorithm deals with oversampling, sampling jitter or non-uniform sample intervals without the need for extra digital anti-aliasing pre-filtering, downsampling or interpolation algorithms, producing multiple models with a cost function that facilitates automatic selection of best-fitted models. Besides, measurement noise is noted as beneficial, bringing up an inherent bias toward low-order models. Simulated examples and a drum-boiler level experimental result exhibiting non-minimum phase behaviour illustrate the application of the proposed method.

Suggested Citation

  • Anísio Rogério Braga & Walmir Caminhas & Carmela Maria Polito Braga, 2018. "A recursive algorithm for estimating multiple models continuous transfer function with non-uniform sampling," International Journal of Systems Science, Taylor & Francis Journals, vol. 49(6), pages 1131-1145, April.
  • Handle: RePEc:taf:tsysxx:v:49:y:2018:i:6:p:1131-1145
    DOI: 10.1080/00207721.2018.1440024
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2018.1440024?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:49:y:2018:i:6:p:1131-1145. 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.