DOA Estimation Exploiting Sparse Array Motions

This paper utilizes sparse array motion to increase the numbers of achievable both degrees of freedom (DOFs) and consecutive lags in direction-of-arrival (DOA) estimation problems. We use commonly employed environment-independent sparse array configurations. The design of these arrays is not depende...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on signal processing 2019-06, Vol.67 (11), p.3013-3027
Hauptverfasser: Qin, Guodong, Amin, Moeness G., Zhang, Yimin D.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper utilizes sparse array motion to increase the numbers of achievable both degrees of freedom (DOFs) and consecutive lags in direction-of-arrival (DOA) estimation problems. We use commonly employed environment-independent sparse array configurations. The design of these arrays is not dependent on the sources in the field of view, but rather aims at achieving desirable difference co-arrays. They include structured coprime and nested arrays, minimum redundancy array (MRA), minimum hole array (MHA), and sparse uniform linear array (SULA). Array motion can fill the holes in the spatial autocorrelation lags associated with a fixed platform and, therefore, increases the number of sources detectable by the same number of array sensors. Quasi-stationarity of the environment is assumed where the source locations and waveforms are considered invariant over array motion of half wavelength. Closed-form expressions of the number of DOFs and consecutive spatial correlation lags for coprime and nested arrays as well as SULA, due to array translation motion, are derived. The number of DOFs and consecutive lags for the specific cases of MRA an 5 avaluated. We show the respective DOA estimation performance based on sparse reconstruction techniques.
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2019.2911261