Direction of Arrival and the Rank-Revealing URV Decomposition
Eugene C. Boman, M. F. Griffen, G. W. Stewart · 1991
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 dicult to update. The algorithms are compared with algorithms based on the singular value decomposition (SVD). This report is available by anonymous ftp from thales.cs.umd.edu in the directory pub/reports. y