The properties of adaptive algorithms with time varying weights

Most adaptive array processing schemes assume that the interference is 'wide sense stationary'. However, in practice this assumption is often violated. For example there may be motion of either the array and/or the interference during the processing interval. The asymptotic performance of two adaptive beamforming algorithms which compensate for this type of changing interference scenario are analyzed in this paper.