DocumentCode
3106438
Title
A least squares algorithm for global joint decomposition of complex matrix sets
Author
Trainini, Tual ; Moreau, Eric
Author_Institution
LSEET, Univ. du Sud Toulon Var, La Valette-du-Var, France
fYear
2011
fDate
13-16 Dec. 2011
Firstpage
313
Lastpage
316
Abstract
This paper deals with a new approach for the joint decomposition of complex matrix sets. Such problems arise naturally in various signal processing problems, among which the blind source separation one. The suggested algorithm is based on an Alternating Least Square (ALS) optimization procedure. An improved version is also proposed including a global Enhanced Line Search (ELS) in the recursive procedure. In practice, the main interest of our approach is to take advantage of a greater amount of signal information within the same context, since sets of Hermitian and symmetric complex matrices are combined altogether. Simulations are performed to highlight the advantages of this method as compared to other existing algorithms.
Keywords
Hermitian matrices; blind source separation; least squares approximations; matrix decomposition; optimisation; set theory; Hermitian sets; alternating least square optimization procedure; blind source separation; global enhanced line search; global joint decomposition; least square algorithm; recursive procedure; signal information; signal processing problem; symmetric complex matrix set; Indexes; Joints; Matrix decomposition; Monte Carlo methods; Signal processing algorithms; Signal to noise ratio; Symmetric matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2011 4th IEEE International Workshop on
Conference_Location
San Juan
Print_ISBN
978-1-4577-2104-5
Type
conf
DOI
10.1109/CAMSAP.2011.6136013
Filename
6136013
Link To Document