TELKOMNIKA (Telecommunication Computing Electronics and Control)
Vol 14, No 1: March 2016

Volterra Series identification Based on State Transition Algorithm with Orthogonal Transformation

Cong Wang (Xinjiang University)
Hong-Li Zhang (Xinjiang University)
Wen-hui Fan (Tsinghua University)



Article Info

Publish Date
01 Mar 2016

Abstract

A Volterra kernel identification method based on state transition algorithm with orthogonal transformation (called OTSTA) was proposed to solve the hard problem in identifying Volterra kernels of nonlinear systems. Firstly, the population with chaotic sequences was initialized by using chaotic strategy. Then the orthogonal transformation was used to finish the mutation operator of the selected individual. OTSTA was used on the identification of Volterra series, and compared with particle swarm optimization (called PSO) and state transition algorithm (STA). The simulation results showed that OTSTA has better identification precision and convergence than PSO and STA under non-noise interference. And when there is noise, the identification precision, convergence and anti-interference of OTSTA are also superior to PSO and STA.

Copyrights © 2016






Journal Info

Abbrev

TELKOMNIKA

Publisher

Subject

Computer Science & IT

Description

Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of ...