Volterra filter modeling of nonlinear discrete-time system using improved particle swarm optimization

  • Authors:
  • Wei-Der Chang

  • Affiliations:
  • Department of Computer and Communication, Shu-Te University, Kaohsiung 824, Taiwan

  • Venue:
  • Digital Signal Processing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper focuses on the identification problem of nonlinear discrete-time systems using Volterra filter series model. Generally, to update the kernels of Volterra model, the most commonly used method is the gradient adaptive algorithm. However, this method probably traps at the local minimum for searching parameter solutions. In this study, a new intelligence swarm computation of the global search is considered. We utilize an improved particle swarm optimization (IPSO) algorithm to design the Volterra kernel parameters. It is somewhat different from the original algorithm due to modifying its velocity updating formula and this can promote the algorithm@?s searching ability for solving the optimization problem. Using the IPSO algorithm to minimize the mean square error (MSE) between the actual output and model output, the identification problem for nonlinear discrete-time systems can be fulfilled. Finally, two different kinds of examples are provided to demonstrate the efficiency of the proposed method. Moreover, some examinations including the Volterra model memory size and algorithm initial condition are further considered.