2023
DOI: 10.3390/electronics12071634
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient 2D DOA Estimation Algorithm Based on OMP for Rectangular Array

Abstract: Recently, orthogonal matching pursuit (OMP) has been widely used in direction of arrival (DOA) studies, which not only greatly improves the resolution of DOA, but can also be applied to single-snapshot and coherent source cases. When applying the OMP algorithm to the rectangular array DOA of the millimeter-wave radar, it is necessary to reshape the two-dimensional (2D) signal into a long one-dimensional (1D) signal. However, the long 1D signal will greatly increase the number and length of atoms in the complet… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 35 publications
0
2
0
Order By: Relevance
“…Conversely, the sparse reconstruction algorithms are intended to build mathematical models between array observation data and the 2D DOA, followed by a series of optimization steps based on different matching criteria, which no longer require the number of sources as a prior and are robust to noise. Nevertheless, the original sparsity-based algorithms divide the entire spatial directions into discrete grids [12][13][14], forming a redundant dictionary to formulate the array data, where the grid mismatch problem may occur to a large extent. In view of this, varieties of off-grid algorithms have been proposed, one after the other, to overcome this strict grid limit by introducing quantization errors between divided grids and real values [15][16][17], and many types of strategies are applied to approximate these errors instead.…”
Section: Introductionmentioning
confidence: 99%
“…Conversely, the sparse reconstruction algorithms are intended to build mathematical models between array observation data and the 2D DOA, followed by a series of optimization steps based on different matching criteria, which no longer require the number of sources as a prior and are robust to noise. Nevertheless, the original sparsity-based algorithms divide the entire spatial directions into discrete grids [12][13][14], forming a redundant dictionary to formulate the array data, where the grid mismatch problem may occur to a large extent. In view of this, varieties of off-grid algorithms have been proposed, one after the other, to overcome this strict grid limit by introducing quantization errors between divided grids and real values [15][16][17], and many types of strategies are applied to approximate these errors instead.…”
Section: Introductionmentioning
confidence: 99%
“…Now, the 2-D direction of arrival estimation problem is widely used in radar, internet of vehicle (IOV) and the fifth-generation (5 G) mobile communications [ 1 , 2 , 3 , 4 , 5 , 6 ]. And many algorithms have been developed to solve the problem of DOA estimation, such as improved reduced dimension MUSIC (IRD-MUSIC), the reduced-dimension multiple signal classification algorithm, and so on [ 7 , 8 , 9 , 10 , 11 , 12 ]. Compared to a 2-D planar array, L-shaped sparse arrays have lower costs and better adaptability.…”
Section: Introductionmentioning
confidence: 99%