- Research Article
- Open access
- Published:
Fast Subspace Tracking Algorithm Based on the Constrained Projection Approximation
EURASIP Journal on Advances in Signal Processing volume 2009, Article number: 576972 (2009)
Abstract
We present a new algorithm for tracking the signal subspace recursively. It is based on an interpretation of the signal subspace as the solution of a constrained minimization task. This algorithm, referred to as the constrained projection approximation subspace tracking (CPAST) algorithm, guarantees the orthonormality of the estimated signal subspace basis at each iteration. Thus, the proposed algorithm avoids orthonormalization process after each update for postprocessing algorithms which need an orthonormal basis for the signal subspace. To reduce the computational complexity, the fast CPAST algorithm is introduced which has complexity. In addition, for tracking the signal sources with abrupt change in their parameters, an alternative implementation of the algorithm with truncated window is proposed. Furthermore, a signal subspace rank estimator is employed to track the number of sources. Various simulation results show good performance of the proposed algorithms.
Publisher note
To access the full article, please see PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Valizadeh, A., Karimi, M. Fast Subspace Tracking Algorithm Based on the Constrained Projection Approximation. EURASIP J. Adv. Signal Process. 2009, 576972 (2009). https://doi.org/10.1155/2009/576972
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1155/2009/576972