检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈沛[1] 赵拥军[1] 刘成城[1] CHEN Pei ZHAO Yongjun LIU Chengcheng(The PLA Information Engineering University, Zhengzhou 450001, China)
机构地区:[1]解放军信息工程大学导航与空天目标工程学院,郑州450001
出 处:《电子与信息学报》2017年第2期301-308,共8页Journal of Electronics & Information Technology
基 金:国家自然科学基金(61401469)~~
摘 要:针对共形阵列天线自适应波束形成中存在的通用性差、主瓣保形困难、计算复杂度高等问题,该文提出一种基于稀疏重构的稳健自适应波束形成算法。该算法通过引入渐进最小方差准则,实现了干扰加噪声协方差矩阵的稀疏重构,并得到期望方向上的导向矢量估计,进而求得波束形成器的最优权矢量。该算法无需复杂的子阵分解或虚拟映射变换,适用于任意阵列形状。仿真实验验证了该算法不仅保证了期望的主瓣响应,同时对指向误差有较好的稳健性。与现有算法相比,该算法所需采样快拍数少,计算复杂度低,收敛速度快,在较大的输入信噪比范围内达到了较好的阵列输出性能。Adaptive beamforming techniques for conformal arrays suffer from poor universality, difficulty to maintain the main beam and high computational cost. A novel robust adaptive beamforming algorithm for conformal arrays based on sparse reconstruction is proposed to alleviate the existing problems. Firstly, by introducing the Asymptotic Minimum Variance (AMV) criterion, the Interference-Plus-Noise (IPN) covariance matrix reconstruction is realized in a sparse way. Secondly, the Steering Vector (SV) of the Signal Of Interest (SOI) is estimated. Finally, the optimal weight coefficients are achieved. Simulation results demonstrate the effectiveness and robustness of the proposed algorithm and prove that this algorithm can achieve superior output performance over the existing adaptive beamforming methods for conformal arrays in a large range of Signal to Noise Ratio (SNR) of the SOI. Moreover, the proposed algorithm needs fewer snapshots with a lower computational cost and has a faster convergence rate.
关 键 词:稳健自适应波束形成 共形阵列 渐进最小方差准则 稀疏重构
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28