Symbolic Computations in Volterra System Identification

Author

Kontosis, K. ; Angelikopoulos, P. ; Koukoulas, P. ; Kalouptsidis, N. ; Emiris, I.

Author_Institution

Dept. of Inf. & Telecommun., Athens Univ.

Volume

3

fYear

2006

fDate

14-19 May 2006

Abstract

This paper is concerned with symbolic computations in Volterra system identification using higher order cumulants. An efficient method that implements the Leonov-Shiryaev theorem is introduced. The proposed method relies on the exploitation of recursive relations between cumulants. The method is applied on the problem of blind identification of Volterra-Hammerstein systems excited by stationary higher order white noise. It solves previously intractable instances

Keywords

Volterra equations; higher order statistics; recursive estimation; signal processing; white noise; Leonov-Shiryaev theorem; Volterra-Hammerstein systems; blind identification; higher order cumulants; recursive relations; stationary higher order white noise; symbolic computations; Broadband amplifiers; Informatics; Nonlinear systems; Power system modeling; Random variables; Signal generators; Signal processing; System identification; Telecommunication computing; White noise;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on

Conference_Location

Toulouse

ISSN

1520-6149

Print_ISBN

1-4244-0469-X

Type

conf

DOI

10.1109/ICASSP.2006.1660749

Filename

1660749