Referenced Items are not available for this document.
In this letter, we present an extension of the PASTd algorithm to both rank and signal subspace tracking. It has a low computational complexity O(nr), where n is the input vector length, and r denotes the signal subspace dimension. Its performance in tracking time-varying direction of arrival is comparable with that of the expensive eigenvalue decomposition and more robust than the O(n/sup 2/) rank revealing URV updating algorithm proposed by Stewart.<
Published in:
Signal Processing Letters, IEEE
(Volume:2
,
Issue:
9
)
Date of Publication: Sept. 1995
- Page(s):
- 179 - 182
- ISSN :
- 1070-9908
- INSPEC Accession Number:
- 5066631
- Digital Object Identifier :
- 10.1109/97.410547
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Sept. 1995
- Sponsored by :
- IEEE Signal Processing Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
