Subscribe
Issue No.03 - March (1997 vol.19)
pp: 282-287
ABSTRACT
<p><b>Abstract</b>—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 {<it>A</it><sub><it>k</it></sub>} and {<it>B</it><sub><it>k</it></sub>} as online observations, with lim<sub><it>k</it>→∞ </sub><it>E</it>[<it>A</it><sub><it>k</it></sub>] = <it>A</it> and lim<sub><it>k</it>→∞ </sub><it>E</it>[<it>B</it><sub><it>k</it></sub>] = <it>B</it>, where <it>A</it> and <it>B</it> are real, symmetric and positive definite. For every sample (<it>A</it><sub><it>k</it></sub>,<it>B</it><sub><it>k</it></sub>), we need the current estimates Φ<sub><it>k</it></sub> and Λ<sub><it>k</it></sub> respectively of the eigenvectors Φ and eigenvalues Λ of <it>A</it><super>−1</super><it>B</it>. We have described such an algorithm where Φ<sub><it>k</it></sub> and Λ<sub><it>k</it></sub> converge provably with probability one to Φ and Λ respectively. A novel computational procedure used in the algorithm is the adaptive computation of <it>A</it><super>−½</super>. 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.</p>
INDEX TERMS