Sliding window adaptive SVD algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE_J_SP Year : 2004

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, designed for rectangular sliding window data matrices. This approach, 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.
Fichier principal
Vignette du fichier
ieee-tsp-04.pdf (465.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00945196 , version 1 (24-03-2014)

Identifiers

  • HAL Id : hal-00945196 , version 1

Cite

Roland Badeau, Gael Richard, Bertrand David. Sliding window adaptive SVD algorithms. IEEE_J_SP, 2004, 52 (1), pp.1--10. ⟨hal-00945196⟩
210 View
1330 Download

Share

Gmail Facebook Twitter LinkedIn More