DOA estimation based on geometric sequence decomposition and sparse reconstruction
In order to solve the problem of direction finding of coherent signals for uniform circular array under the condition of underdetermination, a direction of arrival (DOA) estimation algorithm combining geometric sequence decomposition and sparse reconstruction was proposed.Geometric sequence decompos...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2023-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023011/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In order to solve the problem of direction finding of coherent signals for uniform circular array under the condition of underdetermination, a direction of arrival (DOA) estimation algorithm combining geometric sequence decomposition and sparse reconstruction was proposed.Geometric sequence decomposition was used to split coherent groups and estimate the actual direction vector of each coherent group, while sparse reconstruction was used to estimate DOA for each coherent group.Simulation results demonstrate that when the number of elements of the uniform circular array is M, compared with the existing algorithms, the maximum number of sources that can be estimated by the proposed algorithm is M(M-1).And when the number of sources is large, the success rate and accuracy of direction finding are better.In addition, the proposed algorithm can solve the “angle merger” problem, and has advantages in the direction finding tasks with very few snapshots. |
|---|---|
| ISSN: | 1000-436X |