期刊文献+

一种零陷展宽鲁棒自适应波束形成算法 被引量:13

Robust Adaptive Beamforming with Null Widening
下载PDF
导出
摘要 自适应波束形成器对模型失配与运动干扰非常敏感,特别是训练数据中包含期望信号分量时,较小的系统误差也会导致算法性能严重下降。该文提出一种零陷展宽鲁棒自适应波束形成算法,通过重构和优化干扰加噪声协方差矩阵,并估计真实导向矢量来提高算法抗系统误差与运动干扰的鲁棒性。该算法还可以通过调整主瓣宽度来优化波束旁瓣。仿真实验验证了所提算法的正确性和有效性。 Adaptive beamformers are sensitive to model mismatch and moving interference, especially when the desired signal is present in training snapshots, even a small error can lead to a serious degradation in performance. A robust adaptive beamforming algorithm with null widening is proposed, which is performed by reconstructing and optimizing the interference-plus-noise covariance matrix, and estimating the true steering vector. The sidelobe can be optimized by adjusting the beam width of the mainlobe. Simulation results demonstrate the correctness and effectiveness of the proposed algorithm.
出处 《电子与信息学报》 EI CSCD 北大核心 2013年第11期2764-2770,共7页 Journal of Electronics & Information Technology
基金 国家自然科学基金(51279043,61201411) 水声技术重点实验室基金(9140C200203110C2003) 中央高校基本科研业务费专项基金(HEUCF120502)资助课题
关键词 信号处理 自适应波束形成器 零陷展宽 鲁棒性 Signal processing Adaptive beamformers Null widening Robust
  • 相关文献

参考文献18

  • 1杨志伟,贺顺,廖桂生,刘楠.子空间重构的一类自适应波束形成算法[J].电子与信息学报,2012,34(5):1115-1119. 被引量:19
  • 2金伟,贾维敏,姚敏立,邹翔.一种分解迭代二阶锥规划鲁棒自适应波束形成算法[J].电子与信息学报,2012,34(9):2051-2057. 被引量:11
  • 3Thushara K G, Len Bruton, and Pan Agathoklis. Broadband beamforming of focal plane array (FPA) signals using real-time spatio-temporal 3D FIR frustum digital filters[J]. IEEE Transactions on Antennas and Propagation, 2011, 59(6): 2029-2040.
  • 4Xia Ming-hua, Wu Yik-chung, and Aissa S. Non-orthogonal opportunistic beamforming:performance analysis and implementation[J]. IEEE Transactions on Wireless Communications, 2012, 11(4): 1424-1433.
  • 5Crocco M and Trucco A. Stochastic and analytic optimization of sparse aperiodic arrays and broadband beamformers with robust superdirective patterns[J]. IEEE Transactions on A udio, Speech, and Language Processing, 2012, 20(9): 2433-2447.
  • 6Gershman A B. Robust adaptive beamforming: an overview of recent trends and advances in the field[C]. IEEE International Conference on Antenna Theory and Techniques, Sevastopol, Ukraine, 2003: 30-35.
  • 7Wax M and Anu Y. Performance analysis of the minimum variance beamformer in the presence of steering vector errors[J]. IEEE Transactions on Signal Processing, 1996, 44(4): 938-947.
  • 8金伟,贾维敏,姚敏立.迭代对角加载采样矩阵求逆鲁棒自适应波束形成[J].电子与信息学报,2012,34(5):1120-1125. 被引量:17
  • 9Yujie G and Leshem A. Robust adaptive beamforming based on interference covariance matrix reconstruction and steering vector estimation[J]. IEEE Transactions on Signal Processing, 2012, 60(7): 3881-3885.
  • 10Seung J K, Magnani A, Multapcic A, et al. Robust beamforming via worst-case SINR maximization[J]. IEEE Transactions on Signal Processing, 2008, 56(4): 1539-1547.

二级参考文献67

  • 1林静然,彭启琮,邵怀宗,居太亮.最坏情况下的鲁棒自适应波束形成算法性能分析[J].电子学报,2006,34(12):2161-2166. 被引量:11
  • 2林静然,彭启琮,邵怀宗.一种具有双重鲁棒性的自适应波束形成算法[J].电子测量与仪器学报,2007,21(2):10-14. 被引量:5
  • 3Trees H L V.最优阵列处理技术[M].汤俊,等译.北京:清华大学出版社,2008.467-486.
  • 4Allen B and Ghavami M.Adaptive Array Systems,Fundamentals and Applications[M].Chichester,UK,Wiley,2005,Chapter 1.
  • 5Li J and Stoica P.Robust Adaptive Beamforming[M].Hoboken,NJ,Wiley,2005:1-47.
  • 6Vega L R,Benesty H R J,and Tressens S.A fast robustrecursive least-squares algorithm[J].IEEE Transactions onSignal Processing,2009,57(3):1209-1216.
  • 7Strobach P.Low-rank adaptive filters[J].IEEE Transactionson Signal Processing,1996,44(12):2932-2947.
  • 8Badeau R,David B,and Richard G.Fast approximatedpower iteration subspace tracking[J].IEEE Transactions onSignal Processing,2005,53(8):2931-2941.
  • 9Doukopoulos X and Moustakides G.Fast and stable subspacetracking[J].IEEE Transactions on Signal Processing,2008,56(4):1452-1465.
  • 10Wax M and Kailath T.Detection of signals by informationtheoretic criteria[J].IEEE Transactions on Acoustics,Speech,and Signal Processing,1985,33(2):387-392.

共引文献47

同被引文献79

引证文献13

二级引证文献62

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部