Stochastic Analysis of LMS Algorithm with Delayed Block Coefficient Adaptation

In high sample-rate applications of the least-mean-square (LMS) adaptive filtering algorithm, pipelining or/and block processing is required. In this paper, a stochastic analysis of the delayed block LMS algorithm is presented. As opposed to earlier work, pipelining and block processing are jointly considered and extensively examined. Different analyses for the steady and transient states to estimate the step-size bound, adaptation accuracy and adaptation speed based on the recursive relation of delayed block excess mean square error (MSE) are presented. The effect of different amounts of pipelining delays and block sizes on the adaptation accuracy and speed of the adaptive filter with different filter taps and speed-ups are studied. It is concluded that for a constant speed-up, a large delay and small block size lead to a slower convergence rate compared to a small delay and large block size with almost the same steady-state MSE. Monte Carlo simulations indicate a fairly good agreement with the proposed estimates for Gaussian inputs.