DocumentCode :
2959518
Title :
Third-order Volterra kernels complexity reduction using PARAFAC
Author :
Khouaja, A. ; Kibangou, A. ; Favier, G.
Author_Institution :
Lab. d´´Informatique, Signaux et Syst., Sophia-Antipolis, France
fYear :
2004
fDate :
21-24 March 2004
Firstpage :
857
Lastpage :
860
Abstract :
This paper is concerned with the problem of complexity reduction of third-order Volterra kernels. A tensorial decomposition called PARAFAC is used to represent such a kernel and the alternating least squares (ALS) algorithm is applied to identify this decomposition. Simulation results show the ability of the proposed method to achieve a good complexity reduction, i.e. representation of Volterra cubic kernels with few parameters.
Keywords :
computational complexity; filtering theory; least squares approximations; signal representation; PARAFAC; alternating least squares algorithm; tensorial decomposition; third-order Volterra kernels complexity reduction; Filters; Hydrogen; Kernel; Least squares methods; Linearity; Matrix decomposition; Tensile stress;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control, Communications and Signal Processing, 2004. First International Symposium on
Print_ISBN :
0-7803-8379-6
Type :
conf
DOI :
10.1109/ISCCSP.2004.1296581
Filename :
1296581
Link To Document :
بازگشت