【摘要】 正交投影自适应波束形成算法性能优良,但需要进行矩阵特征分解,运算量大.为了减小正交投影自适应波束形成算法的运算量,提出了一种正交投影自适应数字波束形成快速算法.该算法利用阵列协方差矩阵的一个子矩阵得到干扰子空间,无需特征分解,且无需估计整个协方差矩阵,而只需估计该子矩阵,因而易于工程实现.当阵元数相对干扰数较大时,该算法性能与正交投影算法相差不大,但运算量要小得多.理论分析和计算机仿真结果表明,此方法是有效的.更多还原

【Abstract】 The orthogonal projection algorithm for adaptive beamforming has good performance,but it is expensive in computation because of eigen-decomposition.A fast orthogonal projection algorithm for adaptive beamforming is proposed to reduce the computation complexity of the orthogonal projection algorithm for adaptive beamforming.This algorithm obtains the interference subspace from a submatrix of the array covariance matrix without eigen-decomposition and it only needs estimating the submatrix instead of estimating the whole covariance matrix.Therefore,the algorithm can be implemented easily.The algorithm has a much lower computational complexity in comparison with the orthogonal projection algorithm without sacrificing too much performance when the number of sensors is much larger than that of jammers.Theoretical analysis and computer simulation results show that the method is effective.更多还原