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

An adaptive stochastic approximation algorithm for simultaneous diagonalization of matrix sequences with applications

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)
Chatterjee, C. ; Newport Corp., Irvine, CA, USA ; Roychowdhury, V.P.

We describe an adaptive algorithm based on stochastic approximation theory for the simultaneous diagonalization of the expectations of two random matrix sequences. Although there are several conventional approaches to solving this problem, there are many applications in pattern analysis and signal detection that require an online (i.e., real-time) procedure for this computation. In these applications, we are given two sequences of random matrices {Ak } and {Bk} as online observations, with limk→∞E[Ak]=A and limk→∞E[Bk]=B, where A and B are real, symmetric and positive definite. For every sample (Ak, Bk), we need the current estimates Φk and Λk, respectively of the eigenvectors Φ and eigenvalues Λ of A-1 B. We have described such an algorithm where Φk and Λk converge provably with probability one to Φ and Λ respectively. A novel computational procedure used in the algorithm is the adaptive computation of A. Besides its use in the generalized eigen-decomposition problem, this procedure can be used on its own in several feature extraction problems. The performance of the algorithm is demonstrated with an example of detecting a high-dimensional signal in the presence of interference and noise, in a digital mobile communications problem. Experiments comparing computational complexity and performance demonstrate the effectiveness of the algorithm in this real-time application

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:19 ,  Issue: 3 )

Date of Publication:

Mar 1997

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.