By Topic

Blind source separation via symmetric eigenvalue decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Georgiev, P. ; Sofia Univ., Bulgaria ; Cichocki, A.

We propose a sufficient condition for separation of colored source signals with temporal structure, stating that the separation is possible, if the source signals have different auto-correlation functions. We show that the problem of blind source separation of uncorrelated colored signals can be converted to a symmetric eigenvalue problem of a special covariance matrix Z(b)=Σi=1L b(pi)Rz(pi) depending on L-dimensional parameter b, if this matrix has distinct eigenvalues. We prove that the parameters b for which this is possible, form an open subset of RL, whose complement has a Lebesgue measure zero. A robust orthogonalization of the mixing matrix is used, which is not sensitive to the white noise. We propose a new one-step algorithm, based on non-smooth optimization theory, which disperses the eigenvalues of the matrix Z(b) providing sufficient distance between them

Published in:

Signal Processing and its Applications, Sixth International, Symposium on. 2001  (Volume:1 )

Date of Conference: