Abstract
The author investigates an updating scheme for the rank revealing QR (RRQR) algorithm described earlier by T.F. Chan (see Linear Algebr. Appl., vol.88, no 89, p.67-82 1987) and applies it to the direction of arrival problem. This technique allows for tracking of moving sources by taking advantage of the simplicity of the regular QR updating scheme and the rank-revealing property of the RRQR factorization. Subspace methods and the RRQR technique are reviewed. It is shown that the RRQR algorithm can be used to update signal and noise subspaces from the noise-free correlation matrix. Experimental results and comparisons with eigen-based signal and noise subspaces are presented. >
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.
