By Topic

A new joint diagonalization algorithm with application in blind source separation

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

3 Author(s)
Wang Fuxiang ; Sch. of Electron. & Inf. Eng., Beihang Univ., Beijing, China ; Liu Zhongkan ; Zhang Jun

In this letter, we present a new nonorthogonal algorithm for joint diagonalization of a set of symmetric matrices. The algorithm alternates between updates of individual demixing matrix rows, and the update of each row is transferred to solving the eigenvector problem. By using some blind source separation simulations, we show that the algorithm obviously obtains an improved performance when the signal-to-noise ratio of the observed signals is relatively low.

Published in:

Signal Processing Letters, IEEE  (Volume:13 ,  Issue: 1 )