Bi-iteration recursive instrumental variable subspace tracking and adaptive filtering

7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a class of fast sequential bi-iteration singular value (Bi-SVD) subspace tracking algorithms for adaptive eigendecomposition of the cross covariance matrix in the recursive instrumental variable (RIV) method of system identification. These algorithms can be used for RIV subspace processing of signals in unknown correlated Gaussian noise. Realizations with O(Nr2) and O(Nr) operations per time step are described, where N is the input vector dimension, and r is the number of dominant singular values and vectors to be tracked. The algorithms are solely based on passive Givens plane rotations and standard matrix-vector multiplications. The matrix inversion lemma is not used. The application and performance of the algorithms is demonstrated in a low-rank RIV subspace adaptive filtering context. © 1998 IEEE.

Cite

CITATION STYLE

APA

Strobach, P. (1998). Bi-iteration recursive instrumental variable subspace tracking and adaptive filtering. IEEE Transactions on Signal Processing, 46(10), 2708–2725. https://doi.org/10.1109/78.720373

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free