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.
Type de document :
Article dans une revue
IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2005, 53 (8), pp.2931-2941. 〈10.1109/TSP.2005.850378〉
Liste complète des métadonnées

Littérature citée [35 références]  Voir  Masquer  Télécharger

https://hal-imt.archives-ouvertes.fr/hal-00479772
Contributeur : Admin Télécom Paristech <>
Soumis le : dimanche 2 mai 2010 - 16:22:49
Dernière modification le : jeudi 11 janvier 2018 - 06:23:38
Document(s) archivé(s) le : jeudi 16 septembre 2010 - 13:06:03

Fichier

twocolumns.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Roland Badeau, Bertrand David, Gaël Richard. Fast Approximated Power Iteration Subspace Tracking. IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2005, 53 (8), pp.2931-2941. 〈10.1109/TSP.2005.850378〉. 〈hal-00479772〉

Partager

Métriques

Consultations de la notice

415

Téléchargements de fichiers

300