Fast Approximated Power Iteration Subspace Tracking - IMT - Institut Mines-Télécom Access content directly
Journal Articles IEEE Transactions on Signal Processing Year : 2005

Fast Approximated Power Iteration Subspace Tracking

Abstract

This paper introduces a fast implementation of the power iteration method for subspace tracking, based on an approximation less restrictive than the well known projection approximation. This algorithm, referred to as the fast API method, guarantees the orthonormality of the subspace weighting matrix at each iteration. Moreover, it outperforms many subspace trackers related to the power iteration method, such as PAST, NIC, NP3 and OPAST, while having the same computational complexity. The API method is designed for both exponential windows and sliding windows. Our numerical simulations show that sliding windows offer a faster tracking response to abrupt signal variations.
Fichier principal
Vignette du fichier
twocolumns.pdf (425.28 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00479772 , version 1 (02-05-2010)

Identifiers

Cite

Roland Badeau, Bertrand David, Gael Richard. Fast Approximated Power Iteration Subspace Tracking. IEEE Transactions on Signal Processing, 2005, 53 (8), pp.2931-2941. ⟨10.1109/TSP.2005.850378⟩. ⟨hal-00479772⟩
427 View
727 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More