Joint diagonalisation via weighted generalised eigenvalue decomposition
by Jun Liu, Jingli Li
International Journal of Information Technology, Communications and Convergence (IJITCC), Vol. 1, No. 3, 2011

Abstract: In this correspondence, we propose a new approach for joint diagonalisation of multiple matrices. The proposed algorithm performs generalised eigenvalue decomposition (GEVD) of two weighted matrices, and then optimises the weighting factors so that an upper bound of the mean square error (MSE) of the estimates of the mixing matrix is minimised. The proposed scheme can solve the potential problem in the initialisation step of several existing joint diagonalisation algorithms in the presence of repeated eigenvalues. The simulation results indicate that weighted diagonalisation offers competitive performance for joint diagonalisation.

Online publication date: Sat, 28-Feb-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Technology, Communications and Convergence (IJITCC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com