• DocumentCode
    1271042
  • Title

    Genetic algorithm based identification of nonlinear systems by sparse Volterra filters

  • Author

    Yao, Leehter

  • Author_Institution
    Dept. of Electr. Eng., Nat. Taipei Univ. of Technol., Taiwan
  • Volume
    47
  • Issue
    12
  • fYear
    1999
  • fDate
    12/1/1999 12:00:00 AM
  • Firstpage
    3433
  • Lastpage
    3435
  • Abstract
    A parsimonious parameterization scheme is proposed to model the sparse Volterra filter so that the number of Volterra kernels to be estimated is greatly reduced. Representing the Volterra filter using a linear vector equation, the genetic algorithm is applied to search the significant terms among all possible candidate vectors. As the significant terms are detected, the associated Volterra kernels are estimated using the least square error method. The problem to be solved is, in essence, the application of the genetic algorithm to combinatorial optimization. An operator called forced mutation is proposed along with the genetic algorithm to overcome the difficulties usually encountered when applying the genetic algorithm to combinatorial optimization
  • Keywords
    Volterra series; combinatorial mathematics; delay estimation; filtering theory; genetic algorithms; identification; least squares approximations; mathematical operators; nonlinear filters; nonlinear systems; Volterra kernels; combinatorial optimizatio; forced mutation operator; genetic algorithm; identification; least square error method; linear vector equation; nonlinear systems; parsimonious parameterization scheme; significant terms; sparse Volterra filters; Delay effects; Genetic algorithms; Genetic mutations; Kernel; Least squares approximation; Nonlinear equations; Nonlinear filters; Nonlinear systems; Signal processing; Vectors;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.806093
  • Filename
    806093