Analysis of a recursive least-squares signal-processing algorithm

Abstract

This paper concerns a popular recursive least-squares algorithm for beamforming. The way in which the method's stability depends on the condition of a special matrix is analyzed in detail, and a new procedure for estimating the error in the computed solution is presented.