High Speed LMS Adaptive Filtering

In this paper we show that the least mean square (LMS) algorithm can be speeded up without changing any of its adaptive characteristics. The parallel LMS adaptive filtering algorithm and its modifications are presented. High speed is achieved by increasing the parallelism in the LMS adaptive algorithm through a proper modification of the LMS adaptive algorithm. An iterative procedures for efficient computation of the lower triangular inverse matrix and the input signal covariance matrix are presented.