Direction-of-Arrival Estimation Using the Rank-Revealing URV Decomposition
| dc.contributor.author | Adams, G. | en_US |
| dc.contributor.author | Griffin, M. F. | en_US |
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T22:21:34Z | |
| dc.date.available | 2004-05-31T22:21:34Z | |
| dc.date.created | 1991-03 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | Appeared in Proceedings of ACASSP-91. An algorithm for updating the null space of a matrix is described. The algorithm is based on a new decomposition, called the URV decomposition, which can be updated in $O(N^2)$ and serves as an intermediary between the QR decomposition and the singular value decomposition. The URV decomposition is applied to a high-resolution direction of arrival problem based on the MUSIC algorithm. A virtue of the updating algorithm is the running estimate of rank. Additional files are available via anonymous ftp at: thales.cs.umd.edu in the directory pub/reports (Also cross-referenced as UMIACS-TR-91-46) | en_US |
| dc.format.extent | 110491 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/555 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-2640 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-91-46 | en_US |
| dc.title | Direction-of-Arrival Estimation Using the Rank-Revealing URV Decomposition | en_US |
| dc.type | Technical Report | en_US |