Fast Subspace Tracking Algorithm Based on the Constrained Projection Approximation

We present a new algorithm for tracking the signal subspace recursively. It is based on an interpretation of the signal subspace as the solution of a constrained minimization task. This algorithm, referred to as the constrained projection approximation subspace tracking (CPAST) algorithm, guarantees the orthonormality of the estimated signal subspace basis at each iteration. Thus, the proposed algorithm avoids orthonormalization process after each update for postprocessing algorithms which need an orthonormal basis for the signal subspace. To reduce the computational complexity, the fast CPAST algorithm is introduced which has complexity. In addition, for tracking the signal sources with abrupt change in their parameters, an alternative implementation of the algorithm with truncated window is proposed. Furthermore, a signal subspace rank estimator is employed to track the number of sources. Various simulation results show good performance of the proposed algorithms.

[1]  Joos Vandewalle,et al.  A Singular Value Decomposition Updating Algorithm for Subspace Tracking , 1992, SIAM J. Matrix Anal. Appl..

[2]  Peter Strobach,et al.  Bi-iteration SVD subspace tracking algorithms , 1997, IEEE Trans. Signal Process..

[3]  Eric M. Dowling,et al.  A TQR-iteration based adaptive SVD for real time angle and frequency tracking , 1994, IEEE Trans. Signal Process..

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

[5]  Daniel J. Rabideau,et al.  Fast, rank adaptive subspace tracking and applications , 1996, IEEE Trans. Signal Process..

[6]  Karim Abed-Meraim,et al.  A New Look at the Power Method for Fast Subspace Tracking , 1999, Digit. Signal Process..

[7]  Benoît Champagne,et al.  Adaptive eigendecomposition of data covariance matrices based on first-order perturbations , 1994, IEEE Trans. Signal Process..

[8]  J. Bunch,et al.  Rank-one modification of the symmetric eigenproblem , 1978 .

[9]  Roland Badeau,et al.  Fast approximated power iteration subspace tracking , 2005, IEEE Transactions on Signal Processing.

[10]  G. W. Stewart,et al.  An updating algorithm for subspace tracking , 1992, IEEE Trans. Signal Process..

[11]  Yingbo Hua,et al.  Fast subspace tracking and neural network learning by a novel information criterion , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[12]  Roland Badeau,et al.  Sliding window adaptive SVD algorithms , 2004, IEEE Transactions on Signal Processing.

[13]  Christian H. Bischof,et al.  On updating signal subspaces , 1992, IEEE Trans. Signal Process..

[14]  Benoît Champagne,et al.  Plane rotation-based EVD updating schemes for efficient subspace tracking , 1998, IEEE Trans. Signal Process..

[15]  Donald W. Tufts,et al.  Two algorithms for fast approximate subspace tracking , 1999, IEEE Trans. Signal Process..

[16]  Y. Hua,et al.  Fast orthonormal PAST algorithm , 2000, IEEE Signal Processing Letters.

[17]  Roland Badeau,et al.  Approximated power iterations for fast subspace tracking , 2003, Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings..

[18]  Ilkka Karasalo,et al.  Estimating the covariance matrix by signal subspace averaging , 1986, IEEE Trans. Acoust. Speech Signal Process..

[19]  Gene H. Golub,et al.  Fast algorithms for updating signal subspaces , 1994 .

[20]  Ronald D. DeGroat,et al.  Noniterative subspace tracking , 1992, IEEE Trans. Signal Process..