Show simple item record

Direction of Arrival and the Rank-Revealing URV Decomposition

dc.contributor.authorBoman, E. C.en_US
dc.contributor.authorGriffen, M. F.en_US
dc.contributor.authorStewart, G. W.en_US
dc.description.abstractIn 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.extent135177 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-2813en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-91-166en_US
dc.titleDirection of Arrival and the Rank-Revealing URV Decompositionen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record