Robust Adaptive Beamforming Algorithm for Sparse Array Based on Covariance Matrix Reconstruction Technology

Author:

Du Yuxi1ORCID,Cui Weijia1ORCID,Wang Yinsheng1ORCID,Jian Chunxiao1,Zhang Jian1

Affiliation:

1. National Digital Switching System Engineering & Technological Research Center, Zhengzhou, Henan Province 450001, China

Abstract

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.

Funder

National Natural Science Foundation of China

Publisher

Hindawi Limited

Subject

Electrical and Electronic Engineering

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3