Low-Complexity DOA Estimation via OMP and Majorization-Minimization

Traditional sparse representation algorithms for direction-of-arrival (DOA) estimation always discrete successive azimuths domain and assume the DOAs lie in prior discretized spatial grid. However, discretization incurs errors and leads to poor performance in practice owning to that there always exi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2018 IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP) s. 18 - 19
Hlavní autoři: Zhang, Xiaowei, Li, Yingsong, Yuan, Yuqi, Jiang, Tao
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.08.2018
Témata:
Array signal processing
Azimuth
Direction-of-arrival estimation
DOA estimation
Estimation
Iterative methods
Majorization-Minimization (MM)
Matching pursuit algorithms
Orthogonal Matching Pursuit (OMP)
Signal processing algorithms
sparse representation
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Traditional sparse representation algorithms for direction-of-arrival (DOA) estimation always discrete successive azimuths domain and assume the DOAs lie in prior discretized spatial grid. However, discretization incurs errors and leads to poor performance in practice owning to that there always exist mismatches between the discrete azimuths and the true continuous DOAs. Several efforts have been worked to resolve grid mismatches issue, but these techniques involve serious computational burden. In this paper, a low-complexity DOA estimation method is proposed, which firstly efficiently shrinks dimension of dictionary utilizing Orthogonal Matching Pursuit (OMP), then a iterative refine algorithm is developed by Majorization-Minimization (MM) method. Numerical results show that the proposed algorithm achieves superior performance for handing DOA estimation with low-complexity as well as high accuracy.
DOI:10.1109/APCAP.2018.8538168