摘要
本文提出了一种新的RLS(recursive least square)型子阵权系数的递推算法.该算法可应用于GS C(generalized sidelobe canceler)结构,无需遵守每个子权矢量的维数必须大于信号源个数的限制。在总权系数的维数为N,子权矢量的维数较小时,运算量可由标准RLS的O(N_2)降到(o(N).同时算法具有更快的收敛速度,且保持了对干扰信号的良好的抑制性能.
This paper presents a new subarray asynchronous recursive least square algorithm (SARLS). The method could be appled to generalized sidelobe canceler (GSC)-based structure. The dimension of subweight could be smaller than the number of interferers. interferers usingg small dimension subweights, the new method has faster convergence sqeed than that of conVentional are. The computational load is reduced from o(N2_) of con ventional are to O(N) of SARLS while similar beamforming performance is retained. Several simulation results are included for illustration and comparison.
出处
《信号处理》
CSCD
1999年第4期341-345,共5页
Journal of Signal Processing