.png){kind=icon}
Return
A Computationally Efficient Subspace Algorithm for 2-D DOA Estimation with L-shaped Array
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2014.2321791.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, a computationally efficient subspace algorithm is developed for two-dimensional (2-D) direction-of-arrival (DOA) estimation with L-shaped array structured by two uniform linear arrays (ULAs). The proposed method requires neither constructing the correlation matrix of the received data nor performing the singular value decomposition (SVD) of the correlation matrix. The problem is solved by dealing with three vectors composed of the first column, the first row and diagonal entries of the correlation matrix, which reduces the computational burden. Simultaneously, the proposed method utilizes the conjugate symmetry to enlarge the effective array aperture, which improves the estimation precision. The simulation results are presented to validate the effectiveness of the proposed algorithm.
Keywords:
L-shaped array
the conjugate symmetry
two-dimensional DOA
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available
Cited Papers
Modification of the structure and electrochemical properties of poly(thiophene) by ether groups
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSaveShareSave
ShareSaveKinetic and Equilibrium Studies on the Adsorption of Crystal Violet Dye using Kaolin as an Adsorbent
PREAI
ShareSave
View more