Algorithms and architectures for split recursive least squares
In this paper, a new computationally efficient algorithm for recursive least-squares (RLS) filtering is presented. The proposed split RLS algorithm can perform the approximated RLS with O(N) complexity for signals having no special data structure to be exploited. Our performance analysis shows that the estimation bias will be small when the input data are less correlated. We also show that for highly correlated data, the orthogonal preprocessing scheme can be used to improve the performance of the split RLS. The systolic implementation of our algorithm based on the QR-decomposition RLS (QRD-RLS) array requires only O(N) hardware complexity and the system latency can be reduced to O(log/sub 2/ N). A major advantage of the split RLS is its superior tracking capability over the conventional RLS under non-stationary environments.