Symbolic Computations in Volterra System Identification
Lists
Only you see this
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
BibTeX
@inproceedings{kontosis2006symbolic,
author = {Kimon Kontosis and Panagiotis Angelikopoulos and Panos Koukoulas and Nicholas Kalouptsidis and Ioannis Z. Emiris},
title = {{Symbolic Computations in Volterra System Identification}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2006},
doi = {10.1109/icassp.2006.1660749},
}Loading related content...