Direction of Arrival and the Rank-Revealing URV Decomposition
| dc.contributor.author | Boman, E. C. | en_US |
| dc.contributor.author | Griffen, M. F. | en_US |
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T22:21:54Z | |
| dc.date.available | 2004-05-31T22:21:54Z | |
| dc.date.created | 1991-12 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | In many practical direction-of-arrival (DOA) problems the number of sources and their directions from an antenna array do not remain stationary. Hence a practical DOA algorithm must be able to track changes with a minimal number of snapshots. In this paper we describe DOA algorithms, based on a new decomposition, that are not expensive to compute or difficult to update. The algorithms are compared with algorithms based on the singular value decomposition (SVD). (Also cross-referenced as UMIACS-TR-91-166) | en_US |
| dc.format.extent | 135177 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/561 | |
| 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-2813 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-91-166 | en_US |
| dc.title | Direction of Arrival and the Rank-Revealing URV Decomposition | en_US |
| dc.type | Technical Report | en_US |