首页> 外文期刊>MATEC Web of Conferences >An optimized 2D-Robust Adaptive Beamforming algorithm based on Matrix Completion in sparse array
【24h】

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, 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.
机译:稀疏阵列可以减少波束成形的成本,它大大减少了实际阵列元素的数量。但是,这也带来了信息丢失的问题。提出了一种基于奇异值阈值算法的稀疏阵列二维鲁棒自适应波束形成算法。首先,基于矩阵补全建立了平面阵列的信号模型,可以证明其满足零空间特性。然后使用遗传算法对稀疏阵列进行优化,确定稀疏阵列以减少矩阵完成的频谱范数误差,并使阵列恢复为更接近完整阵列。在稀疏阵列的情况下,使用奇异值阈值理论恢复丢失的信息,然后将恢复的信号用于设计数字波束成形器权重。该算法显着降低了频谱范数误差,并形成了鲁棒的自适应波束。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号