Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at We apologize for any inconvenience.
By Topic

Stable Subspace Tracking Algorithm Based on a Signed URV Decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mu Zhou ; Dept. of Electr. Eng., Math. & Comput. Sci., Delft Univ. of Technol., Delft, Netherlands ; van der Veen, A.-J.

Subspace estimation and tracking are of fundamental importance in many signal processing algorithms. The class of “Schur subspace estimators” provides a complete parametrization of all “principal subspace estimates,” defined as the column spans of corresponding low-rank matrix approximants that lie within a specified 2-norm distance of a given matrix. The parametrization is found in terms of a two-sided hyperbolic decomposition (Hyperbolic URV, or HURV), which can be computed using hyperbolic rotations. Unfortunately, such rotations are commonly associated with numerical instabilities.In this paper, we present a numerically stable, non-iterative algorithm to compute the HURV, called the Signed URV (SURV) algorithm. We show that this algorithm implicitly imposes certain constraints on the HURV such that important norm bounds that guarantee stability are satisfied. The constraints also restrict the parametrization of the subspace estimate such that it becomes close to the principal subspace provided by the SVD (which is a special case within this class). The complexity of the algorithm is of the same order as that of a QR update. Updating and downdating are of the same complexity and are both numerically stable. SURV is proven to provide rank estimates consistent with the SVD with the same rank threshold. It can replace an SVD where only subspace estimation is needed. Typical applications would e.g. be the detection of the number of signals in array signal processing, and subspace estimation for source separation and interference mitigation, such as the first step in MUSIC and ESPRIT-type algorithms. Simulation results demonstrate the numerical stability and confirm that this algorithm provides exact rank estimates and good principal subspace estimates as compared to the SVD.

Published in:

Signal Processing, IEEE Transactions on  (Volume:60 ,  Issue: 6 )