Robust Adaptive Beamforming Algorithm for Sparse Array Based on Covariance Matrix Reconstruction Technology
When the array structure of the sparse arrays (SA) cannot be determined, the existing beamforming algorithms designed according to specific formations such as coprime arrays (CA), nested arrays (NA), etc. will fail. To solve this problem, we propose two algorithms that are suitable for a variety of...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | International Journal of Antennas and Propagation |
| Online Access: | http://dx.doi.org/10.1155/2022/1442459 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | When the array structure of the sparse arrays (SA) cannot be determined, the existing beamforming algorithms designed according to specific formations such as coprime arrays (CA), nested arrays (NA), etc. will fail. To solve this problem, we propose two algorithms that are suitable for a variety of SA. In the first method, assuming that the desired signal is a non-Gaussian signal, the desired signal direction vector (DSDV) is estimated using the fourth-order cumulant, and then the interference plus noise covariance matrix (INCM) is reconstructed by integrating the area outside the desired signal. When the desired signal is a Gaussian signal, we propose the second method. The second method estimates the power and direction of arrival (DOA) of the signals by performing eigenvalue decomposition on the sampled covariance matrix (SCM) and finally calculates the weight vector. However, this method needs to estimate the DOA of the signals, so it has certain requirements for the SA structure design. The simulation results show that the proposed method has good performance and strong robustness under different SA. |
|---|---|
| ISSN: | 1687-5877 |