首页> 中文期刊> 《中南大学学报》 >Blind adaptive constrained constant modulus algorithms based on unscented Kalman filter for beamforming

Blind adaptive constrained constant modulus algorithms based on unscented Kalman filter for beamforming

         

摘要

This work proposes constrained constant modulus unscented Kalman filter (CCM-UKF) algorithm and its low-complexity version called reduced-rank constrained constant modulus unscented Kalman filter (RR-CCM-UKF) algorithm for blind adaptive beamforming. In the generalized sidelobe canceller (GSC) structure, the proposed algorithms are devised according to the CCM criterion. Firstly, the cost function of the constrained optimization problem is transformed to suit the Kalman filter-style state space model. Then, the optimum weight vector of the beamformer can be estimated by using the recursive formulas of UKF. In addition,the a priori parameters of UKF (system and measurement noises) are processed adaptively in the implementation. Simulation results demonstrate that the proposed algorithms outperform the existing methods in terms of convergence speeds, output signal-tointerference-plus-noise ratios (SINRs), mean-square deviations (MSDs) and robustness against steering mismatch.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号