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 ...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.展开更多
Based on a uniform linear array, a new widely linear unscented Kalman filter-based constant modulus algorithm (WL-UKF-CMA) for blind adaptive beamforming is proposed. The new algorithm is designed according to the con...Based on a uniform linear array, a new widely linear unscented Kalman filter-based constant modulus algorithm (WL-UKF-CMA) for blind adaptive beamforming is proposed. The new algorithm is designed according to the constant modulus criterion and takes full advantage of the noncircular property of the signal of interest (SOI), significantly increasing the output signal-to interference-plus-noise ratio (SINR), enhancing the convergence speed and decreasing the steady-state misadjustment. Since it requires no known training data, the proposed algorithm saves a large amount of the available spectrum. Theoretical analysis and simulation results are presented to demonstrate its superiority over the conventional linear least mean square-based CMA (L-LMS-CMA), the conventional linear recursive least square-based CMA (L-RLS-CMA), WL-LMS-CMA, WL-RLS-CMA and L-UKF-CMA.展开更多
A new mulfitarget constant modulus array is proposed for CDMA systems based on least squares constant modulus algorithm. The new algorithm is called pre-despreading decision directed least squares constant modulus alg...A new mulfitarget constant modulus array is proposed for CDMA systems based on least squares constant modulus algorithm. The new algorithm is called pre-despreading decision directed least squares constant modulus algorithm （D-DDLSCMA）. In the new algorithm, the pre-despreading is first applied for multitarget arrays to remove some multiple access signals, then the despreaded signal is processed by the algorithm which united the constant modulus algorithm and decision directed method. Simulation results illustrate the good performance for the proposed algorithm.展开更多
现有全脉冲结构波形与处理方法,如相位编码波形匹配处理存在多普勒容忍度差的固有缺陷,线性调频(linear frequency modulation,LFM)波形加窗处理降低了距离分辨率和信噪比(signal-to-noise ratio,SNR)增益,难以适应高速多目标探测的任...现有全脉冲结构波形与处理方法,如相位编码波形匹配处理存在多普勒容忍度差的固有缺陷,线性调频(linear frequency modulation,LFM)波形加窗处理降低了距离分辨率和信噪比(signal-to-noise ratio,SNR)增益,难以适应高速多目标探测的任务需求。为此,本文提出了一种面向高速目标探测的多子脉冲结构波形设计与处理方法。首先,构建具有多子脉冲结构波形的回波模型,利用分段子脉冲压缩处理和子脉冲间相参处理方法,导出多子脉冲结构波形的距离-多普勒响应函数;然后,根据感兴趣的目标距离速度区间,建立恒模约束下以最小化加权积分距离-多普勒旁瓣电平为目标函数的多子脉冲结构波形优化设计问题;最后,引入坐标下降(coordinate descent,CD)优化框架,将高维非凸约束优化问题的求解转变为多个一维优化问题的迭代求解,且推导出这些低维问题的闭式解。仿真表明,所设计的多子脉冲结构波形具有较好的多普勒容忍度和较低的局部距离-多普勒旁瓣电平,且在高速多目标认知探测场景下,相比于LFM波形、模糊函数优化波形和LFM-noise波形具有更好的高速目标探测能力。展开更多
基金Project(61573113)supported by the National Natural Science Foundation of ChinaProject(2014RFXXJ074)supported by the Science and Technology Innovation Talents Research Fund of Harbin,China
文摘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.
基金supported by the National Natural Science Foundation of China(61573113)the Harbin Science and Technology Innovation Talents(Excellent Discipline Leader)Research Fund(2014RFXXJ074)the National Scholarship([2016]3100)
文摘Based on a uniform linear array, a new widely linear unscented Kalman filter-based constant modulus algorithm (WL-UKF-CMA) for blind adaptive beamforming is proposed. The new algorithm is designed according to the constant modulus criterion and takes full advantage of the noncircular property of the signal of interest (SOI), significantly increasing the output signal-to interference-plus-noise ratio (SINR), enhancing the convergence speed and decreasing the steady-state misadjustment. Since it requires no known training data, the proposed algorithm saves a large amount of the available spectrum. Theoretical analysis and simulation results are presented to demonstrate its superiority over the conventional linear least mean square-based CMA (L-LMS-CMA), the conventional linear recursive least square-based CMA (L-RLS-CMA), WL-LMS-CMA, WL-RLS-CMA and L-UKF-CMA.
文摘A new mulfitarget constant modulus array is proposed for CDMA systems based on least squares constant modulus algorithm. The new algorithm is called pre-despreading decision directed least squares constant modulus algorithm （D-DDLSCMA）. In the new algorithm, the pre-despreading is first applied for multitarget arrays to remove some multiple access signals, then the despreaded signal is processed by the algorithm which united the constant modulus algorithm and decision directed method. Simulation results illustrate the good performance for the proposed algorithm.
文摘现有全脉冲结构波形与处理方法,如相位编码波形匹配处理存在多普勒容忍度差的固有缺陷,线性调频(linear frequency modulation,LFM)波形加窗处理降低了距离分辨率和信噪比(signal-to-noise ratio,SNR)增益,难以适应高速多目标探测的任务需求。为此,本文提出了一种面向高速目标探测的多子脉冲结构波形设计与处理方法。首先,构建具有多子脉冲结构波形的回波模型,利用分段子脉冲压缩处理和子脉冲间相参处理方法,导出多子脉冲结构波形的距离-多普勒响应函数;然后,根据感兴趣的目标距离速度区间,建立恒模约束下以最小化加权积分距离-多普勒旁瓣电平为目标函数的多子脉冲结构波形优化设计问题;最后,引入坐标下降(coordinate descent,CD)优化框架,将高维非凸约束优化问题的求解转变为多个一维优化问题的迭代求解,且推导出这些低维问题的闭式解。仿真表明,所设计的多子脉冲结构波形具有较好的多普勒容忍度和较低的局部距离-多普勒旁瓣电平,且在高速多目标认知探测场景下,相比于LFM波形、模糊函数优化波形和LFM-noise波形具有更好的高速目标探测能力。
