Performance analysis of the block least mean square algorithm

An exact performance analysis of the BLMS algorithm is presented in this paper. Based on equations describing second statistics behavior, bounds are derived for the adaptation gain guaranteeing convergence of the algorithm. Within these bounds an optimal choice of this gain is presented resulting in the fastest convergence rate of the algorithm.