Cart (Loading....) | Create Account
Close category search window
 

A Direct Algorithm for Nonorthogonal Approximate Joint Diagonalization

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)
Chabriel, G. ; IM2NP, Univ. du Sud Toulon, La Garde, France ; Barrere, J.

While a pair of N × N matrices can almost always be exactly and simultaneously diagonalized by a generalized eigendecomposition, no exact solution exists in the case of a set with more than two matrices. This problem, termed approximate joint diagonalization (AJD), is instrumental in blind signal processing. When the set of matrices to be jointly diagonalized includes at least N linearly independent matrices, we propose a suboptimal but closed-form solution for AJD in the direct least-squares sense. The corresponding non-iterative algorithm is given the acronym DIEM (DIagonalization using Equivalent Matrices). Extensive numerical simulations show that DIEM is both fast and accurate compared to the state-of-the-art iterative AJD algorithms.

Published in:

Signal Processing, IEEE Transactions on  (Volume:60 ,  Issue: 1 )

Date of Publication:

Jan. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.