.png){kind=icon}
.png){kind=icon}
Return
A Low-Complexity Method for Two-Dimensional Direction-of-Arrival Estimation Using an L-Shaped Array
.png){kind=icon}
OA
AI
DOI：10.3390/s17010190.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a new low-complexity method for two-dimensional (2D) direction-of-arrival (DOA) estimation is proposed. Based on a cross-correlation matrix formed from the L-shaped array, the proposed algorithm obtains the automatic pairing elevation and azimuth angles without eigendecomposition, which can avoid high computational cost. In addition, the cross-correlation matrix eliminates the effect of noise, which can achieve better DOA performance. Then, the theoretical error of the algorithm is analyzed and the Cramer-Rao bound (CRB) for the direction of arrival estimation is derived. Simulation results demonstrate that, at low signal-to-noise ratios (SNRs) and with a small number of snapshots, in contrast to Tayem's algorithm and Kikuchi's algorithm, the proposed algorithm achieves better DOA performance with lower complexity, while, for Gu's algorithm, the proposed algorithm has slightly inferior DOA performance but with significantly lower complexity.
Keywords:
low-complexity
2D DOA estimation
L-shaped array
automatic pairing
theoretical analysis
Cramer-Rao bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.1W
Citations:
20.9W
View more organizations