An optimized 2D-Robust Adaptive Beamforming algorithm based on Matrix Completion in sparse array

The sparse arrays can reduce the cost of beamforming, it greatly reduces the number of actual array elements. However, it also brings about the problem of information loss. A 2D-robust adaptive beamforming algorithm in sparse array based on Singular Value Thresholding algorithm is proposed. At first...

Full description

Bibliographic Details
Main Authors: Di Jiaying, Hu Wen, Li Mengxia, Li Hongtao
Format: Article
Language:English
Published: EDP Sciences 2018-01-01
Series:MATEC Web of Conferences
Online Access:https://doi.org/10.1051/matecconf/201820801003
Description
Summary:The sparse arrays can reduce the cost of beamforming, it greatly reduces the number of actual array elements. However, it also brings about the problem of information loss. A 2D-robust adaptive beamforming algorithm in sparse array based on Singular Value Thresholding algorithm is proposed. At first, a signal model of planar array is established based on Matrix Completion, which can be proved to meet Null Space Property. Then the Genetic Algorithm is used to optimize the sparse array, which is determined to reduce the Spectral Norm Error of Matrix Completion and make the array recovered closer to the full array. In the case of sparse array, the missing information is restored by using the theory of Singular Value Thresholding, and then the restored signal is used to design the digital beamformer weights. This algorithm significantly reduces the Spectral Norm Error and forms robust adaptive beam.
ISSN:2261-236X