Robust Adaptive Beamforming Algorithm for Sparse Subarray Antenna Array Based on Hierarchical Weighting
Year: 2022
Type: article
Abstract: Sparse antenna arrays based on subarrays have more and more broad application prospects for the limitation of array space, real-time algorithm and hardware costs. Aiming at the beamforming technology of sparse antenna arrays based on subarrays, this paper proposes a robust adaptive beamforming algorithm based on hierarchical weighting. The algorithm performs conventional beamforming to calculate the weights of each element in the subarray, then the synthetic signals output by each subarray are used as sparse array metadata. The Interference-plus-Noise Covariance Matrix (INCM) is reconstructed by integration in two-dimensional space, and a convex optimization model of a multi-constraint array containing the signal pointing error was established to estimate the real guide vector. Finally, using the reconstructed INCM and the estimation of the guide vector, we obtain a weighted vector between the subarrays and output signal for the whole array. The simulation results show that the proposed algorithm has better Signal-to-Interference-and-Noise Ratio (SINR) and robustness compared with other algorithms for sparse subarray antenna array beamforming.
Source: Micromachines
DOI: 10.3390/mi13060859
Authors: Jian Yang, Xinxin Liu, Yuwei Tu, Weixing Li
Language: English
Subfield: Signal Processing
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,094
Awards: 高动态飞行器分布式异形天线阵列信号处理关键技术研究, G830313301
OpenAlex ID: W4281661531
