arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.0101cs.ITmath.IT
收藏

基于约束恒模准则的鲁棒自适应波束形成算法

Robust Adaptive Beamforming Algorithms Based on the Constrained Constant Modulus Criterion

L. Landau, R. C. de Lamare, M. Haardt

摘要:

利用期望信号的恒模特性,提出了一种基于最坏情况准则和约束恒模方法的鲁棒自适应波束形成算法。类似于现有的最坏情况下的波束形成器与最小方差设计,该问题可以重新表示为一个二阶锥(SOC)的程序和解决内点法。对优化问题进行了分析,得到了加强其凸性和调整其参数的条件。在此基础上,提出了基于修正共轭梯度(MCG)和交替优化策略的低复杂度鲁棒自适应波束形成算法。所提出的低复杂度的算法可以计算现有的最坏情况下的约束最小方差(WC-CMV)和建议的最坏情况下的约束恒模(WC-CCM)设计的参数的数量的二次成本。仿真结果表明,该算法的性能优于现有的鲁棒波束形成算法。此外,数值结果还表明,所提出的低复杂度的算法的性能相当于或优于现有的鲁棒算法,而复杂度是一个数量级以上的低。

英文摘要:

We present a robust adaptive beamforming algorithm based on the worst-case criterion and the constrained constant modulus approach, which exploits the constant modulus property of the desired signal. Similarly to the existing worst-case beamformer with the minimum variance design, the problem can be reformulated as a second-order cone (SOC) program and solved with interior point methods. An analysis of the optimization problem is carried out and conditions are obtained for enforcing its convexity and for adjusting its parameters. Furthermore, low-complexity robust adaptive beamforming algorithms based on the modified conjugate gradient (MCG) and an alternating optimization strategy are proposed. The proposed low-complexity algorithms can compute the existing worst-case constrained minimum variance (WC-CMV) and the proposed worst-case constrained constant modulus (WC-CCM) designs with a quadratic cost in the number of parameters. Simulations show that the proposed WC-CCM algorithm performs better than existing robust beamforming algorithms. Moreover, the numerical results also show that the performances of the proposed low-complexity algorithms are equivalent or better than that of existing robust algorithms, whereas the complexity is more than an order of magnitude lower.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑