Sliding Window Adaptive SVD Algorithms

Abstract

The singular value decomposition (SVD) is an important tool for subspace estimation. In adaptive signal processing, we are especially interested in tracking the SVD of a recursively updated data matrix. This paper introduces a new tracking technique that is designed for rectangular sliding window data matrices. This approach, which is derived from the classical bi-orthogonal iteration SVD algorithm, shows excellent performance in the context of frequency estimation. It proves to be very robust to abrupt signal changes, due to the use of a sliding window. Finally, an ultra-fast tracking algorithm with comparable performance is proposed.

Keywords

This publication has 30 references indexed in Scilit:

Unified stabilization approach to principal and minor components extraction algorithms
Neural Networks, 2001
Fast recursive subspace adaptive ESPRIT algorithms
IEEE Transactions on Signal Processing, 1998
Conjugate gradient eigenstructure tracking for adaptive spectral estimation
IEEE Transactions on Signal Processing, 1995
Adaptive estimation of eigensubspace
IEEE Transactions on Signal Processing, 1995
Adaptive Principal component EXtraction (APEX) and applications
IEEE Transactions on Signal Processing, 1994
Fast algorithms for updating signal subspaces
IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1994
Least mean square error reconstruction principle for self-organizing neural-nets
Neural Networks, 1993
An updating algorithm for subspace tracking
IEEE Transactions on Signal Processing, 1992
ESPRIT-estimation of signal parameters via rotational invariance techniques
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
NEURAL NETWORKS, PRINCIPAL COMPONENTS, AND SUBSPACES
International Journal of Neural Systems, 1989