Revisiting adaptive signal subspace estimation based on Rayleigh's quotient

We propose a new adaptive algorithm for subspace estimation and tracking that is based on Rayleigh's quotient. This algorithm allows the estimation of the signal subspace of a vector sequence. It has a number of interesting properties such as a low computational complexity, a fast convergence, orthogonality of the subspace vectors which is ensured at each iteration and a good numerical stability. The proposed algorithm outperforms Oja's algorithm.

[1]  Y. Hua,et al.  Orthogonal Oja algorithm , 2000, IEEE Signal Processing Letters.

[2]  Qin Lin,et al.  A unified algorithm for principal and minor components extraction , 1998, Neural Networks.

[3]  G. Golub,et al.  Tracking a few extreme singular values and vectors in signal processing , 1990, Proc. IEEE.

[4]  Gene H. Golub,et al.  Matrix computations , 1983 .

[5]  Bin Yang,et al.  Projection approximation subspace tracking , 1995, IEEE Trans. Signal Process..

[6]  Messaoud Benidir,et al.  The propagator method for source bearing estimation , 1995, Signal Process..

[7]  Erkki Oja,et al.  Principal components, minor components, and linear neural networks , 1992, Neural Networks.

[8]  Jar-Ferr Yang,et al.  Adaptive eigensubspace algorithms for direction or frequency estimation and tracking , 1988, IEEE Trans. Acoust. Speech Signal Process..

[9]  H. Vincent Poor,et al.  Blind Multiuser Detection: A Subspace Approach , 1998, IEEE Trans. Inf. Theory.

[10]  S. Amari,et al.  A self-stabilized minor subspace rule , 1998, IEEE Signal Processing Letters.