Abstract
Tracking the dominant subspace of a data matrix is an essential part of many signal processing algorithms. We present a modification to the so-called spherical subspace tracking algorithm. This algorithm has a low computational complexity, but suffers from accumulation of numerical errors. We show that this numerical instability can be circumvented by using a minimal orthogonal parameterization of the subspace basis matrix. The resulting factored spherical SVD updating algorithm then consists exclusively of rotation operations. In view of implementing the algorithm in real-time applications with high data rates, a linear systolic architecture is derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
