Plane rotation-based EVD updating schemes for efficient subspace tracking

被引:44
作者
Champagne, B [1 ]
Liu, QG
机构
[1] Univ Quebec, INRS Telecommun, Verdun, PQ H3E 1H6, Canada
[2] Nortel Inc, Verdun, PQ, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
D O I
10.1109/78.700961
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We present new algorithms based on plane rotations for tracking the eigenvalue decomposition (EVD) of a time-varying data covariance matrix, These algorithms directly produce eigenvectors in orthonormal form and are well suited for the application of subspace methods to nonstationary data. After recasting EVD tracking as a simplified rank-one EVD update problem, computationally efficient solutions are obtained in two steps, First, a new kind of parametric perturbation approach is used to express the eigenvector update as an unimodular orthogonal transform, which is represented in exponential matrix form in terms of a reduced set of small, unconstrained parameters. Second, two approximate decompositions of this exponential matrix into products of plane (or Givens) rotations are derived, one of which being previously unknown. These decompositions lead to new plane rotation-based EVD-updating schemes (PROTEUS), whose main feature is the use of plane rotations for updating the eigenvectors, thereby preserving orthonormality, Finally, the PROTEUS schemes are used to derive new EVD trackers whose convergence and numerical stability are investigated via simulations, One algorithm can track all the signal subspace EVD components in only O(LM) operations, where L and M, respectively, denote the data vector and signal subspace dimensions while achieving a performance comparable to an exact EVD approach and maintaining perfect orthonormality of the eigenvectors. The new algorithms show no signs of error buildup.
引用
收藏
页码:1886 / 1900
页数:15
相关论文
共 54 条
[31]   A SINGULAR VALUE DECOMPOSITION UPDATING ALGORITHM FOR SUBSPACE TRACKING [J].
MOONEN, M ;
VANDOOREN, P ;
VANDEWALLE, J .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1992, 13 (04) :1015-1038
[32]   EIGENDECOMPOSITION VERSUS SINGULAR VALUE DECOMPOSITION IN ADAPTIVE ARRAY SIGNAL-PROCESSING [J].
ORTIGUEIRA, MD ;
LAGUNAS, MA .
SIGNAL PROCESSING, 1991, 25 (01) :35-49
[33]  
Owsley N. L., 1978, Proceedings of the 1978 IEEE International Conference on Acoustics, Speech and Signal Processing, P109
[34]  
Pango PA, 1997, INT CONF ACOUST SPEE, P3833, DOI 10.1109/ICASSP.1997.604719
[35]   Fast, rank adaptive subspace tracking and applications [J].
Rabideau, DJ .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1996, 44 (09) :2229-2244
[36]   LEAST-SQUARES TYPE ALGORITHM FOR ADAPTIVE IMPLEMENTATION OF PISARENKOS HARMONIC RETRIEVAL METHOD [J].
REDDY, VU ;
EGARDT, B ;
KAILATH, T .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1982, 30 (03) :399-405
[37]   AN ADAPTIVE UNIT NORM FILTER WITH APPLICATIONS TO SIGNAL ANALYSIS AND KARHUNEN-LOEVE TRANSFORMATIONS [J].
REGALIA, PA .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1990, 37 (05) :646-649
[38]  
Rellich F., 1969, Notes on Mathematics and Its Applications
[39]   MULTIPLE EMITTER LOCATION AND SIGNAL PARAMETER-ESTIMATION [J].
SCHMIDT, RO .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 1986, 34 (03) :276-280
[40]   IMPLEMENTATION OF ADAPTIVE ARRAY-ALGORITHMS [J].
SCHREIBER, R .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1986, 34 (05) :1038-1045