Fast identification of Wiener-Hammerstein systems using discrete optimisation

A fast identification algorithm for Wiener-Hammerstein systems is proposed. The computational cost of separating the front and the back linear time-invariant (LTI) block dynamics is significantly improved by using discrete optimisation. The discrete optimisation is implemented as a genetic algorithm...

Full description

Saved in:
Bibliographic Details
Published in:Electronics letters 2014-12, Vol.50 (25), p.1942-1944
Main Authors: Schoukens, M, Vandersteen, G, Rolain, Y, Ferranti, F
Format: Article
Language:English
Subjects:
Accuracy
Algorithms
back linear time‐invariant block dynamics
Blocking
circuit optimisation
computational cost
Computational efficiency
discrete optimisation
Dynamical systems
Dynamics
genetic algorithm
Genetic algorithms
identification
Information and communications
LTI
Mathematical models
nonlinear network synthesis
Optimization
Wiener‐Hammerstein system fast identification algorithm
Citations: Items that this one cites
Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A fast identification algorithm for Wiener-Hammerstein systems is proposed. The computational cost of separating the front and the back linear time-invariant (LTI) block dynamics is significantly improved by using discrete optimisation. The discrete optimisation is implemented as a genetic algorithm. Numerical results confirm the efficiency and accuracy of the proposed approach.
ISSN:0013-5194
1350-911X
1350-911X
DOI:10.1049/el.2014.3649