顽健自适应波束形成算法

针对方向向量偏差会导致最小均方(LMS)算法的性能急剧下降这一问题,提出了一种基于可变对角载入的顽健自适应波束形成算法.采用最陡下降法对信号方向向量进行优化求解,并在每次迭代过程中更新对角载入值,进而求出最优的权重向量,避免了矩阵求逆运算和特征值分解运算,大大降低了计算复杂度.通过建立步长与输入信号的关系得到可变的步长因子,克服了收敛速度和稳态误差之间的矛盾.该算法收敛速度快,抗扰动性强,对信号方向向量偏差具有很强的顽健性,从而改善了阵列输出的信干噪比,使其更接近最优值.理论分析和仿真结果表明与传统自适应波束形成算法相比,所提顽健算法具有更好的性能.     

基于二次型约束的鲁棒最小二乘恒模算法

阵列指向性偏差会导致线性约束最小二乘恒模算法(LSCMA)的性能急剧下降,为此提出了一种基于二次型约束的鲁棒LSCMA算法。该算法通过对期望信号波达方向附近小区域内的方向向量的误差模值进行约束来构造一种新的代价函数,并在此函数下迭代更新权重向量,以提高算法的鲁棒性。该算法收敛速度快,稳态性能好,能够有效地解决干扰捕获问题,对阵列指向性偏差具有很强的鲁棒性,从而改善了阵列输出的信干噪比,使其更接近最优值。仿真结果表明:与线性约束最小二乘恒模算法相比,所提鲁棒算法提高了输出性能,降低了计算量,易于实时实现,且能适应实际复杂的通信环境。     

基于二次型约束的鲁棒自适应波束形成算法

针对期望信号方向向量存在偏差会导致自适应波束形成算法的性能急剧下降这一问题,该文提出了一种基于二次型约束的鲁棒自适应波束形成算法。通过对期望信号波达方向附近范围内的方向向量的误差模值进行约束,来提高算法的鲁棒性,并在此约束条件下对权重向量进行优化求解,且优化解中的参数能够准确求出。该算法可有效地控制波束主瓣区域内信号的畸变,并能够抑制方向向量偏差所带来的影响,提高了系统的鲁棒性,同时使干扰和噪声的功率输出最小,保证了对干扰信号的抑制能力,改善了阵列输出的信干噪比,使其更接近最优值。仿真结果验证了所提算法的有效性与优越性。     

一种改进均方误差性能的新型鲁棒性波束形成算法

结合信干噪比最大化和均方误差最小化两个优化目标,提出一种新型的鲁棒性波束形成算法.该方法考虑信号估计误差,在传统的最小方差的代价函数中引入信号协方差矩阵的估计误差,并在波达角估计误差的约束下,将鲁棒性波束形成器转换成基于支持向量机形式的波束形成器,通过一种高效的新型支持向量机训练算法计算阵列权值;然后以均方误差最小化为目标来修正阵列权值.仿真结果表明:该方法降低了波束形成器对信号估计误差的敏感度,提高了其抑制非平稳干扰的能力,且具有更好的均方误差性能.     

改进的双约束稳健Capon波束形成算法

传统双约束稳健Capon波束形成算法采用牛顿迭代法求解最优加载量,存在计算精度低且运算量大的问题。该文提出一种改进的双约束稳健Capon波束形成(DCRCB)算法,该算法对信号协方差矩阵进行重构,基于期望信号导向矢量在噪声子空间的投影最优,将重构后的干扰加噪声协方差矩阵投影到噪声子空间,得到基于噪声子空间的双约束算法模型。该算法中通过模约束的辅助约束作用,将改进的双约束算法模型转化为单约束问题,最终解得最优对角加载量的解析表达式。仿真结果表明改进算法能通过调整主瓣宽度优化波束旁瓣,有效提高了抗矢量偏差的鲁棒性,同时降低了运算量。     

一种空间色噪声环境下的鲁棒自适应波束

该文提出了一种基于对角加载的鲁棒自适应波束形成算法,以提高空间色噪声环境中自适应波束对方向矢量误差的鲁棒性。该算法首先利用噪声协方差矩阵对阵列相关矩阵进行预白化,同时定义了一个与噪声矩阵相对应的椭圆方向矢量模糊集,然后,通过在该模糊集内进行最坏情况性能优化来确定对角加载因子。和现有的通过迭代求解加载因子的方法不同,该文给出了最优加载因子的近似解析表达式,降低了运算量,揭示了哪些因素可以影响最优加载因子,以及如何影响。仿真结果表明,在空间色噪声环境中,该算法具有很好的鲁棒性,并且,给出的加载因子表达式是其真实最优解的一个准确近似。     

阵列天线波束赋形的混合遗传算法优化

本文提出了一种应用于阵列天线波束赋形优化的混合遗传算法.该算法将简化的步长加速法作为一个局部搜索算子,融入到基于实数编码的遗传算法中.局部搜索算子的引入,使得新算法同时具有了传统遗传算法在全局搜索时的鲁棒性和步长加速法在局部搜索中搜索较快的优点.文中分别利用该算法对16元直线阵列进行了平顶波束和余割平方波束赋形优化,仿真结果表明了该算法在阵列天线波束赋形优化问题上的应用是有效的.     

基于矩阵完型的干涉式阵列米波雷达解模糊算法

针对干涉阵列米波雷达方向估计中的模糊问题,该文提出了基于矩阵完型的解模糊算法.该方法将干涉技术中的辅助阵元解模糊方法扩展到干涉阵列中,通过增加适当的辅助阵元,使干涉式阵列成为完型阵列,再依次采用直接增广法、MUSIC算法及关联法实现干涉阵列方向估计的解模糊,从而得到高精度无模糊的方向估计.为了估计相干源的波达方向,该文根据干涉阵列结构的特点及空间平滑算法的原理也提出了干涉阵列的空间平滑算法.仿真结果和实测数据验证了矩阵完型解模糊算法和干涉阵列的空间平滑算法的正确性与有效性,也表明了该文的解模糊方法具有计算量小,实时性高等特点.     

一种基于遗传算法的阵列天线方向图综合

基于排序的实数码遗传算法实现对阵列天线方向图综合,并对遗传参数作了一些改进.该算法使得搜索效率有很大的提高,有效避免了早期收敛.通过计算机仿真实验,该算法成功地实现了阵列天线的方向图综合.通过对阵列天线的阵元电流幅值进行优化,同样可以达到传统方法所能实现的效果.良好的仿真结果体现了遗传算法在阵列天线方向图综合中的优越性能.     

基于子空间分解的阵列流形向量估计新方法

实际阵列装配完成后的阵列流形向量与理论值存在偏差,这种偏差会导致阵列预设波束图的旁瓣升高、阵列高分辨算法的性能下降,严重影响阵列的实际应用。实际中先依据估计的部分实际阵列流形向量选取合适的误差模型,再根据模型得到逼近实际的阵列流形向量。现有的实际阵列流形向量估计方法有直接定义法和最小二乘法,这两种方法计算复杂度很高且估计精度随快拍数波动。对此本文给出一种新的阵列实际流形向量估计方法,它利用阵列接收数据协方差矩阵的信号子空间与阵列流形向量张成空间相同的特性来估计阵列的实际幅度相位响应,结合估计的波达方向,最后得到实际的阵列流形向量。仿真结果表明,本文所提方法比现有的两种估计方法估计精度高一倍且计算复杂度降低了一个数量级。      

Robust Adaptive Beamforming Under Quadratic Constraint with Recursive Method Implementation

When adaptive arrays are applied to practical problems, the performances of the conventional adaptive beamforming algorithms are known to degrade substantially in the presence of even slight mismatches between the actual and presumed array responses to the desired signal. Similar types of performance degradation can occur because of data nonstationarity and small training sample size, when the signal steering vector is known exactly. In this paper, to account for mismatches, we propose robust adaptive beamforming algorithm for implementing a quadratic inequality constraint with recursive method updating, which is based on explicit modeling of uncertainties in the desired signal array response and data covariance matrix. We show that the proposed algorithm belongs to the class of diagonal loading approaches, but diagonal loading terms can be precisely calculated based on the given level of uncertainties in the signal array response and data covariance matrix. The variable diagonal loading term is added at each recursive step, which leads to a simpler closed-form algorithm. Our proposed robust recursive algorithm improves the overall robustness against the signal steering vector mismatches and small training sample size, enhances the array system performance under random perturbations in sensor parameters and makes the mean output array SINR consistently close to the optimal one. Moreover, the proposed robust adaptive beamforming can be efficiently computed at a low complexity cost compared with the conventional adaptive beamforming algorithms. Computer simulation results demonstrate excellent performance of our proposed algorithm as compared with the existing adaptive beamforming algorithms.     

鲁棒约束恒模自适应波束形成算法

线性约束恒模算法能够有效克服恒模算法中存在的干扰捕获问题,但在信号方向向量存在偏差的情况下,其性能将会受到影响.针对上述问题,本文提出了鲁棒约束恒模自适应算法并对其性能进行了分析.该算法收敛速度快,抗扰动性强,对信号方向向量的偏差具有较强的鲁棒性,改善了系统的输出信干噪比.仿真实验表明,与线性约束恒模算法相比,鲁棒约束恒模算法具有很好的性能.     

Robust Least Squares Constant Modulus Algorithm to Signal Steering Vector Mismatches

The linearly constrained least squares constant modulus algorithm (LSCMA) may suffer significant performance degradation and lack robustness in the presence of the slight mismatches between the actual and assumed signal steering vectors, which can cause the serious problem of desired signal cancellation. To account for the mismatches, we propose a doubly constrained robust LSCMA based on explicit modeling of uncertainty in the desired signal array response and data covariance matrix, which provides robustness against pointing errors and random perturbations in detector parameters. Our algorithm optimizes the worst-case performance by minimizing the output SINR while maintaining a distortionless response for the worst-case signal steering vector. The weight vector can be optimized by the partial Taylor-series expansion and Lagrange multiplier method, and the optimal value of the Lagrange multiplier is iteratively derived based on the known level of uncertainty in the signal DOA. The proposed implementation based on iterative minimization eliminates the covariance matrix inversion estimation at a comparable cost with that of the existing LSCMA. We present a theoretical analysis of our proposed algorithm in terms of convergence, SINR performance, array beampattern gain, and complexity cost in the presence of random steering vector mismatches. In contrast to the linearly constrained LSCMA, the proposed algorithm provides excellent robustness against the signal steering vector mismatches, yields improved signal capture performance, has superior performance on SINR improvement, and enhances the array system performance under random perturbations in sensor parameters. The on-line implementation and significant SINR enhancement support the practicability of the proposed algorithm. The numerical experiments have been carried out to demonstrate the superiority of the proposed algorithm on beampattern control and output SINR enhancement compared with linearly constrained LSCMA.     

频率不变约束的角加载稳健宽带波束形成算法

应用角加载技术能够提高波束形成算法稳健性,但是角加载量确定却是一个难解决问题。文中提出了一种基于频率不变约束的可变角加载最优稳健波束形成算法(Frequency Invariance Constraints-Variable Diagonal Loading,FIC-VDL)。该算法基于宽带波束形成的时域模型,根据多频点约束下导向矢量的不确定范围,利用频率不变约束因子将多频点变为参考频点约束来求解最优角加载量,并推导出真实的导向矢量。该方法能够改善宽带波束形成器在期望方向的频率不变特性,同时降低系统计算复杂度。计算机仿真结果验证了所提算法的稳健性。     

最坏情况下的鲁棒自适应波束形成算法性能分析

研究了最坏情况下的鲁棒自适应波束形成算法,它通过对角加载提高波束对方向矢量误差的鲁棒性.给出了其最优对角加载因子的近似解析达式,揭示了各种因素如何影响最优加载因子.在此基础上,对该算法进行了性能分析,推导出了关于目标功率估计和信号干扰噪声比的近似表达式.计算机仿真验证了本文的分析.     

On Diagonal Loading for Robust Adaptive Beamforming Based on Worst‐Case Performance Optimization

Robust adaptive beamforming based on worst‐case performance optimization is investigated in this paper. It improves robustness against steering vector mismatches by the approach of diagonal loading. A closed‐form solution to optimal loading is derived after some approximations. Besides reducing the computational complexity, it shows how different factors affect the optimal loading. Based on this solution, a performance analysis of the beamformer is carried out. As a consequence, approximated closed‐form expressions of the source‐of‐interest power estimation and the output signal‐to‐interference‐plus‐noise ratio are presented in order to predict its performance. Numerical examples show that the proposed closed‐form expressions are very close to their actual values.     

Robust adaptive beamforming using worst-case performance optimization: a solution to the signal mismatch problem

Adaptive beamforming methods are known to degrade if some of underlying assumptions on the environment, sources, or sensor array become violated. In particular, if the desired signal is present in training snapshots, the adaptive array performance may be quite sensitive even to slight mismatches between the presumed and actual signal steering vectors (spatial signatures). Such mismatches can occur as a result of environmental nonstationarities, look direction errors, imperfect array calibration, distorted antenna shape, as well as distortions caused by medium inhomogeneities, near-far mismatch, source spreading, and local scattering. The similar type of performance degradation can occur when the signal steering vector is known exactly but the training sample size is small. In this paper, we develop a new approach to robust adaptive beamforming in the presence of an arbitrary unknown signal steering vector mismatch. Our approach is based on the optimization of worst-case performance. It turns out that the natural formulation of this adaptive beamforming problem involves minimization of a quadratic function subject to infinitely many nonconvex quadratic constraints. We show that this (originally intractable) problem can be reformulated in a convex form as the so-called second-order cone (SOC) program and solved efficiently (in polynomial time) using the well-established interior point method. It is also shown that the proposed technique can be interpreted in terms of diagonal loading where the optimal value of the diagonal loading factor is computed based on the known level of uncertainty of the signal steering vector. Computer simulations with several frequently encountered types of signal steering vector mismatches show better performance of our robust beamformer as compared with existing adaptive beamforming algorithms.     

基于谱分析的稳健自适应波束形成算法

针对在导向矢量存在误差情况下,自适应波束形成算法性能下降问题,提出一种基于谱分析的稳健自适应波束形成(SA-RAB)算法。算法利用空域与频域的对称性,根据真实导向矢量与理想导向矢量之间的误差,运用谱分析(SA)技术确定波束主瓣宽度,最后利用二阶锥规划(SOCP)技术在主瓣宽度内形成平顶响应,并在副瓣区域内进行干扰抑制。仿真结果表明:该算法可有效地抑制干扰,并输出理想的信号干扰噪声比(SINR),且提高了波束形成针对导向矢量误差的稳健性,验证了算法的有效性和优越性。