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

自适应集员降秩最小二乘波束形成算法

Adaptive Set-Membership Reduced-Rank Least Squares Beamforming Algorithms

Lei Wang, Rodrigo C. de Lamare

摘要:

提出了一种新的线性约束最小方差波束形成器(LCMV)自适应设计算法。我们将集员滤波(SMF)机制降秩联合迭代优化(JIO)计划开发一个约束递归最小二乘(RLS)算法称为JIO-SM-RLS。所提出的算法继承了降秩信号处理技术的优点,以提高输出性能,并利用SMF方法的数据选择性更新(约10-15%),以节省计算成本显着。一个有效的时变界限施加在阵列输出作为约束,以规避风险的上界或下界,并更新参数的波束形成。更新后的参数构成一组解决方案(隶属度集),满足LCMV波束形成器的约束。仿真结果表明,该算法在收敛速度和降低计算复杂性方面均优于现有算法。

英文摘要:

This paper presents a new adaptive algorithm for the linearly constrained minimum variance (LCMV) beamformer design. We incorporate the set-membership filtering (SMF) mechanism into the reduced-rank joint iterative optimization (JIO) scheme to develop a constrained recursive least squares (RLS) based algorithm called JIO-SM-RLS. The proposed algorithm inherits the positive features of reduced-rank signal processing techniques to enhance the output performance, and utilizes the data-selective updates (around 10-15%) of the SMF methodology to save the computational cost significantly. An effective time-varying bound is imposed on the array output as a constraint to circumvent the risk of overbounding or underbounding, and to update the parameters for beamforming. The updated parameters construct a set of solutions (a membership set) that satisfy the constraints of the LCMV beamformer. Simulations are performed to show the superior performance of the proposed algorithm in terms of the convergence rate and the reduced computational complexity in comparison with the existing methods.

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

↑