By Topic

A Fast Algorithm for Nonunitary Joint Diagonalization and Its Application to 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)

A fast algorithm, named Complex-Valued Fast Frobenius DIAGonalization (CVFFDIAG), is proposed for seeking the nonunitary approximate joint diagonalizer of a given set of complex-valued target matrices. It adopts a multiplicative update to minimize the Frobenius-norm formulation of the approximate joint diagonalization problem. At each of multiplicative iterations, a strictly diagonally dominant updated matrix is obtained. This scheme ensures the invertibility of the diagonalizer. The CVFFDIAG relaxes several constraints on the target matrices and thus has much general applications. Furthermore, the special approximation of the cost function, the ingenious utilization of some structures and the adequate notation of concerned variables lead to the high computational efficiency of the proposed algorithm. Numerical simulations are conducted to illustrate good performances of the CVFFDIAG.

Published in:

Signal Processing, IEEE Transactions on  (Volume:59 ,  Issue: 7 )