A new efficient subspace tracking algorithm based on singular value decomposition
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A new algorithm for signal subspace tracking is presented. It is based on an approximated singular value decomposition using interlaced QR-updating and Jacobi plane rotations. By forcing the noise subspace to be spherical, the computational complexity of the algorithm is brought down to O(nr), where n is the problem dimension and r is the desired number of signal components. The algorithm lends itself for a very efficient systolic array implementation, resulting in a throughput of O(n/sup 0/). Simulations show that the frequency tracking capabilities of the new method are at least as good as those of the computationally much more expensive exact singular value decomposition.Keywords
This publication has 4 references indexed in Scilit:
- Subspace tracking based on the projection approach and the recursive least squares methodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- An updating algorithm for subspace trackingIEEE Transactions on Signal Processing, 1992
- Noniterative subspace trackingIEEE Transactions on Signal Processing, 1992
- Updating Singular Value Decompositions. A Parallel Implementation.Published by SPIE-Intl Soc Optical Eng ,1989