Abstract
Traditional adaptive filters assume that the effective rank of the input signal is the same as the input covariance matrix or the filter length N. Therefore, if the input signal lives in a subspace of dimension less than N, these filters fail to perform satisfactorily. In this paper, we present two new algorithms for adapting only in the dominant signal subspace. The first of these is a low-rank recursive-least-squares (RLS) algorithm that uses a ULV decomposition to track and adapt in the signal subspace. The second adaptive algorithm is a subspace tracking least-meansquares (LMS) algorithm that uses a generalized ULV (GULV) decomposition, developed in this paper, to track and adapt in subspaces corresponding to several well-conditioned singular value clusters. The algorithm also has an improved convergence speed compared with that of the LMS algorithm. Bounds on the quality of subspaces isolated using the GULV decomposition are derived, and the performance of the adaptive algorithms are analyzed.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1282-1297 |
| Number of pages | 16 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 46 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1998 |
Bibliographical note
Funding Information:Manuscript received September 12, 1996; revised September 23, 1997. This work was supported in part by ONR under Grant N00014-92-J-1678, AFOSR under Grant AF/F49620-93-1-0151DEF, DARPA under Grant US-DOC6NANB2D1272, and NSF under Grant CCR-9405380. The associate editor coordinating the review of this paper and approving it for publication was Dr. Akihiko Sugiyama.